On connencted \([g,f+1]\)-factors in graphs
From MaRDI portal
Publication:2568495
DOI10.1007/s00493-005-0023-9zbMath1090.05058MaRDI QIDQ2568495
Zhenhong Liu, Guo Jun Li, Ying Xu, Chuanping Chen
Publication date: 27 June 2006
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-005-0023-9
Hamiltonian graphs; \([g, f\)-factors]; Kano's conjecture
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
The stability number and connected \([k,k+1\)-factor in graphs], Degree and stability number condition for the existence of connected factors in graphs