Edge intersection graphs of linear 3-uniform hypergraphs
From MaRDI portal
Publication:5899371
DOI10.1016/j.endm.2005.06.007zbMath1182.05090MaRDI QIDQ5899371
S. V. Suzdal, Pavel Skums, Regina I. Tyshkevich
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.007
forbidden induced subgraph; Krausz decomposition; edge intersection graph; linear 3-uniform hypergraph
Cites Work
- Unnamed Item
- 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