The stability number and connected \([k,k+1]\)-factor in graphs
From MaRDI portal
Publication:1023082
DOI10.1016/J.AML.2008.11.002zbMath1188.05095OpenAlexW1983414614MaRDI QIDQ1023082
Jian-Feng Hou, Gui Zhen Liu, Jian-Sheng Cai
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Sufficient condition for the existence of an even \([a,b\)-factor in graph] ⋮ Stability Number and k-Hamiltonian [a, b-factors] ⋮ A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH ⋮ BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS ⋮ STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-factors and Hamilton cycles in graphs
- Connected \([k,k+1\)-factors of graphs]
- Connected factors in graphs -- a survey
- On connencted \([g,f+1\)-factors in graphs]
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- Subgraphs with prescribed valencies
- The Factors of Graphs
This page was built for publication: The stability number and connected \([k,k+1]\)-factor in graphs
