The stability number and connected [k,k+1]-factor in graphs

DOI10.1016/J.AML.2008.11.002MaRDI QIDQ1023082zbMATH OpenOpenAlexFDO

Authors Jianfeng Hou, Jiansheng Cai, Guizhen Liu

Publication date 10 June 2009

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2008.11.002

zbMATH Keywords

\(k\)-factorconnected \([k, k+1\)-factor]degreegraphstability number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Degree and stability number condition for the existence of connected factors in graphs
• Stability number and [a,b]‐factors in graphs
• Stability number and \(f\)-factor in \(K_{1,n}\)-free graphs
• Stability number and f-factors in graphs
• Neighborhood union and connected \([k,k+1]\)-factors in graphs

Cites work

• \(k\)-factors and Hamilton cycles in graphs
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Connected \([k,k+1]\)-factors of graphs
• Connected factors in graphs -- a survey
• Graph theory
• scientific article; zbMATH DE number 700639 (Why is no real title available?)
• On connencted \([g,f+1]\)-factors in graphs
• Stability number and \(f\)-factor in \(K_{1,n}\)-free graphs
• Subgraphs with prescribed valencies
• The Factors of Graphs

Cited in

(11)

• Degree and stability number condition for the existence of connected factors in graphs
• Stability number and f-factors in graphs
• Extremal graphs with given stability number and connectivity. II
• Stability number and minimum degree for (a, b, k)-critical graphs
• Stability number and \(k\)-Hamiltonian \([a,b]\)-factors
• Stability number and \(f\)-factor in \(K_{1,n}\)-free graphs
• Binding number and minimum degree for fractional (k,m)-deleted graphs
• scientific article; zbMATH DE number 5138378 (Why is no real title available?)
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph
• A sufficient condition for a graph to be a fractional \((f,n)\)-critical graph
• Stability number and [a,b]‐factors in graphs

This page was built for publication: The stability number and connected \([k,k+1]\)-factor in graphs

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