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...

Полное описание

Библиографические подробности

Главный автор:	T. V. Lubasheva
Формат:	Artigo
Язык:	Russo
Опубликовано:	National Academy of Sciences of Belarus, the United Institute of Informatics Problems 2018-12-01
Серии:	Informatika
Предметы:	edge intersection graph of hypergraph forbidden induced subgraph characterization split graph k-chromatic hypergraph coloring
Online-ссылка:	https://inf.grid.by/jour/article/view/443
Метки:	Добавить метку Нет меток, Требуется 1-ая метка записи!