Stability Number and k-Hamiltonian [a, b]-factors

DOI10.1007/978-3-319-53007-9_31zbMath1487.05146OpenAlexW2585873203MaRDI QIDQ2971665

Lan Xu, Si-zhong Zhou, Yang Xu

Publication date: 7 April 2017

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_31

zbMATH Keywords

stability numberminimum degree\(k\)-Hamiltonian \([a,b\)-factor]\(k\)-Hamiltonian graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
• Star subdivisions and connected even factors in the square of a graph
• Neighbor set for the existence of \((g,f,n)\)-critical graphs
• The existence of \(k\)-factors in squares of graphs
• The stability number and connected \([k,k+1\)-factor in graphs]
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Subdigraphs with orthogonal factorizations of digraphs. II
• Maximum fractional factors in graphs
• Hamiltonian ?-factors in graphs
• Subgraphs with prescribed valencies
• A \([k,k+1\)-factor containing a given Hamiltonian cycle]