A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH

DOI10.1017/S0004972714000781zbMath1309.05148OpenAlexW2160459836MaRDI QIDQ5245703

Yunqing Zhang, Yaojun Chen, Xiaolan Hu

Publication date: 14 April 2015

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972714000781

zbMATH Keywords

complementalmost balanced bipartition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• On circuits in graphs
• Vertex colorings without isolates
• Graph partitions with minimum degree constraints
• On decomposition of triangle-free graphs under degree constraints
• Decomposing graphs with girth at least five under degree constraints

This page was built for publication: A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH