Recognizing large-degree Intersection Graphs of Linear 3-Uniform Hypergraphs


The intersection graph or the line graph Ω(H) of a hypergraph H is defined as follows: 1) the vertices of Ω(H) are in a bijective correspondence with the edges of H, 2) two vertices are adjacent in Ω(H) if and only if the corresponding edges intersect. Characterizing and recognizing intersection graphs of hypergraphs with some additional property P is one… (More)

3 Figures and Tables


  • Presentations referencing similar topics