Recognizing Intersection Graphs of Linear Uniform Hypergraphs
- 41 Downloads
A hypergraph is linear if any two distinct hyperedges have at most one common vertex. The existence of a polynomial algorithm is shown for deciding whether a graph of minimum degree δ ≥ 19 is the intersection graph of a linear 3-uniform hypergraph. This result improves a corollary of the finite forbidden subgraph characterization proved for δ ≥ 69 by Naik et al. in . Essentially the same methods yield a polynomial recognition algorithm for the intersection graph of a linear r-uniform hypergraph, r ≥ 3, provided the minimum edge-degree of the graphs is at least 2r 2 − 3r + 1. This improves on the cubic bound that follows from the corresponding finite characterization result in .
KeywordsMinimum Degree Maximal Clique Intersection Graph Polynomial Algorithm Common Vertex
Unable to display preview. Download preview PDF.
- 1.Beineke, L.W.: On derived graphs and digraphs. In: H. Saks et al.: Beiträge zur Graphentheorie pp. 17–23 Leipzig: Teubner, 1968Google Scholar
- 6.Jacobson, M.S., Kézdy, A.E., Lehel, J.: Intersection graphs associated with uniform hypergraphs, submitted for publication.Google Scholar
- 7.Jacobson, M.S., Kézdy, A.E., Lehel, J.: Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete, submitted for publication.Google Scholar