Minimum degree of a graph and the existence of k-factors

DOI10.1007/BF02880991zbMath0586.05030MaRDI QIDQ1071789

P. Katerinis

Publication date: 1985

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

minimum degreek-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ Connected \([k,k+1\)-factors of graphs] ⋮ Minimum degree, independence number and regular factors ⋮ Counting and packing Hamilton cycles in dense graphs and oriented graphs ⋮ Sharp conditions for the existence of an even $[a,b$-factor in a graph] ⋮ Binding number and Hamiltonian (g, f)-factors in graphs II ⋮ An Ore-type condition for the existence of \(k\)-factors in graphs ⋮ Binding numbers and \(f\)-factors of graphs ⋮ Edge-disjoint Hamilton cycles in graphs ⋮ Minimum degree of bipartite graphs and the existence of k-factors ⋮ Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs ⋮ A minimum degree condition of fractional \((k,m)\)-deleted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Some Theorems on Abstract Graphs
• The Factors of Graphs

This page was built for publication: Minimum degree of a graph and the existence of k-factors