Intersection multigraphs of uniform hypergraphs

MaRDI QIDQ1272535zbMATH OpenFDO

Authors Erich Prisner

Publication date 9 April 1999

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

zbMATH Keywords

uniform hypergraphsrecognition algorithmcliquesintersection multigraphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Hypergraphs (05C65)

Recommendations

• Recognizing intersection graphs of linear uniform hypergraphs
• scientific article; zbMATH DE number 6503350
• Recognizing random intersection graphs
• Generalized octahedra and cliques in intersection graphs of uniform hypergraphs

Cited in

(12)

• scientific article; zbMATH DE number 4023333 (Why is no real title available?)
• Induced cycles in triangle graphs
• The representation of multi-hypergraphs by set intersections
• Generalized line graphs: Cartesian products and complexity of recognition
• Generalized octahedra and cliques in intersection graphs of uniform hypergraphs
• The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs
• Small edge sets meeting all triangles of a graph
• On factors of uniform intersection graphs
• 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
• scientific article; zbMATH DE number 3851149 (Why is no real title available?)
• Edge intersection graphs of linear 3-uniform hypergraphs

This page was built for publication: Intersection multigraphs of uniform hypergraphs

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