Toughness for the existence of k-Hamiltonian [a,b]-factors.

MaRDI QIDQ3134314zbMATH OpenFDO

Authors Fan Yang, Sizhong Zhou, Yang Xu

Publication date 9 February 2018

zbMATH Keywords

\(k\)-Hamiltonian \([a,b\)-factor]\(k\)-Hamiltonian graphtoughness

Mathematics Subject Classification ID

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

Recommendations

• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• Stability number and \(k\)-Hamiltonian \([a,b]\)-factors
• Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
• scientific article; zbMATH DE number 5953644

Cited in

(6)

• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• Existence of Hamiltonian k-factor
• Stability number and \(k\)-Hamiltonian \([a,b]\)-factors
• On ID-Hamiltonian \([a,b]\)-factor
• A sufficient condition for graphs to have ID-Hamiltonian \([a,b]\)-factors

This page was built for publication: Toughness for the existence of \(k\)-Hamiltonian \([a,b]\)-factors.

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