Minimum balanced bipartitions of planar triangulations

DOI10.1016/J.DISC.2019.06.028zbMATH Open1429.05170OpenAlexW2960708893MaRDI QIDQ2279262FDOQ2279262

Authors: Abhinav Shantanam 

Publication date: 12 December 2019

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

Full work available at URL: https://doi.org/10.1016/j.disc.2019.06.028

Recommendations

• On minimum balanced bipartitions of triangle-free graphs
• Upper bounds on minimum balanced bipartitions of plane graphs
• Upper bounds on minimum balanced bipartitions
• Upper bounds on minimum balanced bipartition of Hamilton plane graphs
• On balanced bipartitions of graphs
• Bounds for judicious balanced bipartitions of graphs
• Minimum number of partial triangulations
• Balanced judicious bipartitions of graphs
• scientific article; zbMATH DE number 6311292
• A min-max theorem for plane bipartite graphs

zbMATH Keywords

planar triangulationminimum balanced bipartition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Problems and results on judicious partitions
• A Combinatorial Decomposition Theory
• Upper bounds on minimum balanced bipartitions
• Hamilton cycles in plane triangulations
• On alliance partitions and bisection width for planar graphs

Cited In (3)

• Upper bounds on minimum balanced bipartitions
• Minimal clique partitions and pairwise balanced designs
• Balanced triangulations on few vertices and an implementation of cross-flips

This page was built for publication: Minimum balanced bipartitions of planar triangulations

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