\(k\)-factors and Hamilton cycles in graphs
From MaRDI portal
Publication:884893
DOI10.1007/s10114-005-0905-xzbMath1118.05081MaRDI QIDQ884893
Publication date: 7 June 2007
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-005-0905-x
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
The stability number and connected \([k,k+1\)-factor in graphs]
Cites Work