Intersection representation of complete unbalanced bipartite graphs

DOI10.1006/jctb.1997.1779zbMath0907.05031OpenAlexW2018108915MaRDI QIDQ1386430

Nancy Eaton

Publication date: 2 March 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1779

zbMATH Keywords

intersection representation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (4)

Overlap number of graphs ⋮ Tree representations of graphs ⋮ Towards a comprehensive theory of conflict-tolerance graphs ⋮ Constant tolerance intersection graphs of subtrees of a tree

Cites Work

• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• Onp-intersection representations
• The Representation of a Graph by Set Intersections
• Unnamed Item

This page was built for publication: Intersection representation of complete unbalanced bipartite graphs