An Ore-type condition for the existence of \(k\)-factors in graphs
From MaRDI portal
Publication:1180675
DOI10.1007/BF01787640zbMath0763.05082OpenAlexW2007301799MaRDI QIDQ1180675
Tadashi Iida, Tsuyoshi Nishimura
Publication date: 27 June 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01787640
Related Items
Connected \([k,k+1\)-factors of graphs], Minimum degree, independence number and regular factors, Approximation and Exact Algorithms for Special Cases of Connected f-Factors, Sharp conditions for the existence of an even $[a,b$-factor in a graph], Graph factors and factorization: 1985--2003: a survey, Degree conditions for graphs to be fractional \((a, b, n)\)-critical 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], Ore-type conditions for the existence of even \([2,b\)-factors in graphs]
Cites Work