Edge intersection graphs of linear 3-uniform hypergraphs

P.V Skums,S.V Suzdal,R.I Tyshkevich

doi:10.1016/j.disc.2007.12.082

Edge intersection graphs of linear 3-uniform hypergraphs

P.V Skums, S.V Suzdal + Show 1 more

https://doi.org/10.1016/j.disc.2007.12.082

Copy DOI

Journal: Discrete Mathematics	Publication Date: Feb 5, 2008
Citations: 20	License type: elsevier-specific: oa user license

Affiliation: Belarusian State University

#Class Of Graphs #Minimum Vertex Degree + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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 .

Full Text