Recognizing intersection graphs of linear uniform hypergraphs

DOI10.1007/BF03353014zbMATH Open0895.05046MaRDI QIDQ1376077FDOQ1376077

Authors: Michael Jacobson, André E. Kézdy, Jeno Lehel 

Publication date: 6 September 1998

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• Edge intersection graphs of linear 3-uniform hypergraphs
• scientific article; zbMATH DE number 6503350
• On line graphs of linear 3-uniform hypergraphs
• scientific article; zbMATH DE number 2107052

zbMATH Keywords

hypergraphintersection graphlinear hypergraphpolynomial algorithm\(k\)-uniform hypergraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

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?)
• The interchange graph of a finite graph
• Intersection graphs of k-uniform linear hypergraphs
• Title not available (Why is that?)
• Line graphs of hypergraphs. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Recognizing random intersection graphs
• Title not available (Why is that?)
• Edge intersection graphs of linear 3-uniform hypergraphs
• Structure and complexity of 2-intersection graphs of 3-hypergraphs
• 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
• Edge intersection graphs of linear 3-uniform hypergraphs
• The strong intersecting number of a graph
• Title not available (Why is that?)

This page was built for publication: Recognizing intersection graphs of linear uniform hypergraphs

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