Toughness and the existence of Hamiltonian [a, b]-factors of graphs

MaRDI QIDQ2848798zbMATH OpenFDO

Authors Sizhong Zhou

Publication date 26 September 2013

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• Toughness of graphs and the existence of factors
• scientific article; zbMATH DE number 109208
• Toughness, hamiltonicity and split graphs
• Isolated toughness and existence of \([a,b]\)-factors in graphs
• Toughness of graphs and \([2,b]\)-factors
• Toughness and Hamiltonicity of a class of planar graphs
• Toughness, Hamiltonicity and spectral radius in graphs
• A toughness condition for the existence of \(f\)-factors in graphs
• Toughness and \([a,b]\)-factors in graphs.
• scientific article; zbMATH DE number 165068

Cited in

(7)

• scientific article; zbMATH DE number 5936422 (Why is no real title available?)
• Toughness for the existence of \(k\)-Hamiltonian \([a,b]\)-factors.
• An existence theorem on Hamiltonian \((g,f)\)-factors in networks
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• \([a,b]\)-factors of graphs on surfaces
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• Stability number and \(k\)-Hamiltonian \([a,b]\)-factors

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

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