Edge intersection graphs of linear 3-uniform hypergraphs

DOI10.1016/J.ENDM.2005.06.007zbMATH Open1182.05090OpenAlexW2174681728MaRDI QIDQ5899371FDOQ5899371

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

zbMATH Keywords

forbidden induced subgraphKrausz decompositionedge intersection graphlinear 3-uniform hypergraph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65)

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
• Title not available (Why is that?)

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 Q5899371)