Equipartitions of graphs

DOI10.1016/0012-365X(90)90233-8zbMath0761.05051OpenAlexW1973621774MaRDI QIDQ1182860

David Eppstein, Chung-Lun Li, Joan Feigenbaum

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90233-8

zbMATH Keywords

NP-hardequipartitionsparse graphsequipartition problembad pair

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Partitions of sets (05A18)

Related Items (1)

An exact algorithm for min-max hyperstructure equipartition with a connected constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding planar graphs in four pages
• Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism
• On Factorable Extensions and Subgraphs of Prime Graphs
• The Lattice Point Covering Theorem for Rectangles
• Optimal Sequential Partitions of Graphs

This page was built for publication: Equipartitions of graphs