Recognizing intersection graphs of linear uniform hypergraphs

DOI10.1007/BF03353014zbMath0895.05046MaRDI QIDQ1376077

Jenő Lehel, André E. Kézdy, Michael S. Jacobson

Publication date: 6 September 1998

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypergraphintersection graphpolynomial algorithmlinear hypergraph\(k\)-uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs ⋮ Edge intersection graphs of linear 3-uniform hypergraphs ⋮ Edge intersection graphs of linear 3-uniform hypergraphs

Cites Work

• Intersection graphs of k-uniform linear hypergraphs
• Line graphs of hypergraphs. I
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• The interchange graph of a finite graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizing intersection graphs of linear uniform hypergraphs