Edge intersection graphs of linear 3-uniform hypergraphs

Abstract

Let L3 be the class of edge intersection graphs of linear 3-uniform hypergraphs. The problem of recognizing G ∈ L3 is NP-complete. Denote by δALG the minimal integer such that the problem ”G ∈ L3 ” is polynomially solvable in the class of graphs G with the minimal vertex degree δ(G) ≥ δALG and by δFIS the minimal integer such that L3 can be characterized by… (More)
DOI: 10.1016/j.endm.2005.06.007

Topics

Cite this paper

@article{Skums2005EdgeIG, title={Edge intersection graphs of linear 3-uniform hypergraphs}, author={Pavel Skums and S. V. Suzdal and Regina Tyshkevich}, journal={Electronic Notes in Discrete Mathematics}, year={2005}, volume={22}, pages={33-40} }