A degree sequence variant of balanced bipartition problem of graphs.

MaRDI QIDQ4558655zbMATH OpenFDO

Authors Jian-Hua Yin, Jin Guo, Haiyan Li

Publication date 29 November 2018

zbMATH Keywords

balanced bipartitiongraphic sequencelower bound

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35)

Recommendations

• $k$-regular graphic degree sequence variant of judicious balanced bipartition problem of graphs
• Some results of regular graphs on the existence of balanced partition
• On balanced bipartitions of graphs
• Balanced judicious partitions of graphs with \(\Delta(G)-\delta(G))\leqslant 2\)
• Balanced judicious bipartitions of graphs

Cited in

(4)

• Degree symmetric bipartite graphs and equivalent representations
• Constructing a bipartite graph of maximum connectivity with prescribed degrees
• Bounds for elements of the degree sequence of an unknown vertex set in a balanced bipartite graph
• $k$-regular graphic degree sequence variant of judicious balanced bipartition problem of graphs

This page was built for publication: A degree sequence variant of balanced bipartition problem of graphs.

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