A degree condition for the existence ofk-factors

DOI10.1002/JGT.3190160205zbMath0781.05039OpenAlexW2087522602MaRDI QIDQ4013416

Tsuyoshi Nishimura

Publication date: 27 September 1992

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

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

zbMATH Keywords

minimum degreeconnected graph\(k\)-factor

Mathematics Subject Classification ID

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

Related Items (15)

Spectral radius and \([a,b\)-factors in graphs] ⋮ Connected \([k,k+1\)-factors of graphs] ⋮ Minimum degree, independence number and regular factors ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle] ⋮ A degree condition for a graph to have \((a,b)\)-parity factors ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Some new sufficient conditions for graphs to have fractionalk-factors ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ On fractional \((f,n)\)-critical graphs ⋮ A degree condition for graphs having all \((a, b)\)-parity factors ⋮ The \(A_{\alpha}\)-spectral radius and \([a,b\)-factors in graphs] ⋮ Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle ⋮ A \([k,k+1\)-factor containing a given Hamiltonian cycle] ⋮ Connected \(k\)-factors in bipartite graphs

Cites Work

• The Factors of Graphs
• Unnamed Item

This page was built for publication: A degree condition for the existence ofk-factors