Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs
A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph. The multiplicity of a pair of vertices in a hypergraph is the number of hypergraph edges containin...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Russo |
| Publicado em: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2018-12-01
|
| Colecção: | Informatika |
| Assuntos: | |
| Acesso em linha: | https://inf.grid.by/jour/article/view/443 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|