Abstract.
The intersection multigraph of a simple hypergraph H=(V, {X i /i∈I}) has {x i /i∈I} as vertex set. Two distinct vertices x i ≠x j are joined by |X i ∩X j | parallel edges. It is shown how to recognize intersection multigraphs of 3-uniform, 3-conformal hypergraphs in polynomial time and reveal the (essentially unique) root hypergraph. For integers k≥4, intersection multigraphs of k-uniform, k-conformal hypergraphs with one additional property can be recognized.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: January 30, 1995 / Revised: September 17, 1997
Rights and permissions
About this article
Cite this article
Prisner, E. Intersection Multigraphs of Uniform Hypergraphs. Graphs Comb 14, 363–375 (1998). https://doi.org/10.1007/PL00021184
Issue Date:
DOI: https://doi.org/10.1007/PL00021184