Edge intersection graphs of linear 3-uniform hypergraphs
From MaRDI portal
Publication:5902100
DOI10.1016/J.DISC.2007.12.082zbMATH Open1211.05096OpenAlexW2162676538MaRDI QIDQ5902100FDOQ5902100
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
Recommendations
Cites Work
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intersection graphs of k-uniform linear hypergraphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- On line graphs of linear 3-uniform hypergraphs
- Complexity of representation of graphs by set systems
- Recognizing intersection graphs of linear uniform hypergraphs
- An efficient reconstruction of a graph from its line graph in parallel
- Intersection Graphs of k-Uniform Hypergraphs
- Title not available (Why is that?)
- Line hypergraphs
Cited In (9)
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
- Title not available (Why is that?)
- 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)
