Degree sequences and the existence of \(k\)-factors

DOI10.1007/s00373-011-1044-zzbMath1256.05051arXiv0912.2916OpenAlexW2050889084MaRDI QIDQ1926057

Douglas Bauer, Hajo J. Broersma, Edward F. Schmeichel, Nathan Kahl, Jan van den Heuvel

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.2916

zbMATH Keywords

\(k\)-factor graphical degree sequencebest monotone degree conditionnonredundant conditions

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (5)

Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor ⋮ A dimension 6 graph with minimum edge-set ⋮ Best monotone degree conditions for binding number ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Best monotone degree conditions for binding number and cycle structure

Cites Work

• Unnamed Item
• Graph factors and factorization: 1985--2003: a survey
• A short proof of Kundu's k-factor theorem
• A method in graph theory
• The k-factor conjecture is true
• Valencies of graphs with 1-factors
• On small contractible subgraphs in 3-connected graphs of small average degree
• On Hamilton's ideals
• Algorithms for constructing graphs and digraphs with given valences and factors
• Toughness and the existence ofk-factors
• Reguläre Faktoren von Graphen.
• The Factors of Graphs

This page was built for publication: Degree sequences and the existence of \(k\)-factors