Edge intersection graphs of linear 3-uniform hypergraphs

DOI10.1016/J.DISC.2007.12.082MaRDI QIDQ5902100zbMATH OpenOpenAlexFDO

Authors Pavel Skums, S. V. Suzdal', Regina Iosifovna 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)

Recommendations

• scientific article; zbMATH DE number 6503350
• On line graphs of linear 3-uniform hypergraphs
• Intersection multigraphs of uniform hypergraphs
• Recognizing intersection graphs of linear uniform hypergraphs
• Edge-coloring of 3-uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1107734 (Why is no real title available?)
• scientific article; zbMATH DE number 3286813 (Why is no real title available?)
• scientific article; zbMATH DE number 3102314 (Why is no real title available?)
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• An efficient reconstruction of a graph from its line graph in parallel
• Complexity of representation of graphs by set systems
• Intersection Graphs of k-Uniform Hypergraphs
• Intersection graphs of k-uniform linear hypergraphs
• Line hypergraphs
• On line graphs of linear 3-uniform hypergraphs
• Recognizing intersection graphs of linear uniform hypergraphs

Cited in

(10)

• Edge intersection hypergraphs
• \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
• scientific article; zbMATH DE number 6503350 (Why is no real title available?)
• Thomassen's conjecture for line graphs of 3-hypergraphs
• The Local Queue Number of Graphs with Bounded Treewidth
• The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs
• Three ways to cover a graph
• Local clique covering of claw-free graphs
• 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
• On line graphs of linear 3-uniform hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902100)