On connencted [g,f+1]-factors in graphs

DOI10.1007/S00493-005-0023-9MaRDI QIDQ2568495zbMATH OpenOpenAlexFDO

Authors Ying Xu, Ciping Chen, Guojun Li, Zhenhong Liu

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

zbMATH Keywords

\([g, f\)-factors]Hamiltonian graphsKano's conjecture

Mathematics Subject Classification ID

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

Review text

Let \(G=(V(G), E(G))\) be a graph and \(g\) and \(f\) positive integral functions on \(V(G)\) such that \(2 \leq g(v) \leq f(v) \leq d_G(v)\) for all \(v\). The spanning subgraph \(F\) is a \([g, f]\)-factor of \(G\) if \(g(v) \leq d_F(v) \leq f(v)\) for all \(v\). The main result of the paper is that if \(G\) has both a \([g, f]\)-factor and a Hamiltonian path, then \(G\) has a connected \([g, f+1]\)-factor. It is a generalization of Kano's conjecture first solved by \textit{M. Cai} [Syst. Sci. Math. Sci. 8, No. 4, 364--368 (1995; Zbl 0851.05083)].

Recommendations

• Connected (g,f)-factors
• scientific article; zbMATH DE number 913257
• Neighborhood union and connected \([k,k+1]\)-factors in graphs
• scientific article; zbMATH DE number 969172
• Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor

Cited in

(9)

• The stability number and connected \([k,k+1]\)-factor in graphs
• Degree and stability number condition for the existence of connected factors in graphs
• Parity results on connected f-factors
• Connected \([a,b]\)-factors in graphs
• Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs
• scientific article; zbMATH DE number 5371977 (Why is no real title available?)
• On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
• scientific article; zbMATH DE number 1792587 (Why is no real title available?)
• scientific article; zbMATH DE number 6475977 (Why is no real title available?)

This page was built for publication: On connencted \([g,f+1]\)-factors in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568495)