Edge intersection graphs of linear 3-uniform hypergraphs

DOI10.1016/j.disc.2007.12.082zbMath1211.05096OpenAlexW2162676538MaRDI QIDQ5902100

S. V. Suzdal, Pavel Skums, Regina I. Tyshkevich

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.082

zbMATH Keywords

forbidden induced subgraphedge intersection graphkrausz decompositionlinear 3-uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items (5)

Local Clique Covering of Claw-Free Graphs ⋮ Thomassen's conjecture for line graphs of 3-hypergraphs ⋮ Three ways to cover a graph ⋮ 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 ⋮ The Local Queue Number of Graphs with Bounded Treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of representation of graphs by set systems
• Intersection graphs of k-uniform linear hypergraphs
• Recognizing intersection graphs of linear uniform hypergraphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• An efficient reconstruction of a graph from its line graph in parallel
• Intersection Graphs of k-Uniform Hypergraphs
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Line hypergraphs
• On line graphs of linear 3-uniform hypergraphs

This page was built for publication: Edge intersection graphs of linear 3-uniform hypergraphs