Title of article
Edge intersection graphs of linear 3-uniform hypergraphs
Author/Authors
Skums، نويسنده , , P.V. and Suzdal، نويسنده , , S.V. and Tyshkevich، نويسنده , , R.I.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
18
From page
3500
To page
3517
Abstract
Let L 3 l be the class of edge intersection graphs of linear 3-uniform hypergraphs. It is known that the problem of recognition of the class L 3 l is NP-complete. We prove that this problem is polynomially solvable in the class of graphs with minimum vertex degree ≥ 10 . It is also proved that the class L 3 l is characterized by a finite list of forbidden induced subgraphs in the class of graphs with minimum vertex degree ≥ 16 .
Keywords
Edge intersection graph , linear 3-uniform hypergraph , forbidden induced subgraph , krausz decomposition
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598847
Link To Document