Graphic Sequences Have Realizations Containing Bisections of Large Degree

DOI10.1002/jgt.20652zbMath1254.05040OpenAlexW1506921570MaRDI QIDQ4650188

Stephen G. Hartke, Tyler Seacrest

Publication date: 23 November 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20652

zbMATH Keywords

1-factordegree sequencebisection\(k\)-factor

Mathematics Subject Classification ID

Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Stability of the Potential Function ⋮ On balanced bipartitions of graphs ⋮ On problems about judicious bipartitions of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Regular spanning subgraphs of bipartite graphs of high minimum degree
• A short proof of Kundu's k-factor theorem
• The k-factor conjecture is true
• Algorithms for constructing graphs and digraphs with given valences and factors
• Problems and results on judicious partitions

This page was built for publication: Graphic Sequences Have Realizations Containing Bisections of Large Degree