On ID-Hamiltonian [a,b]-factor

MaRDI QIDQ5206593zbMATH OpenFDO

Authors J. Wu, Quanru Pan, Sizhong Zhou

Publication date 18 December 2019

zbMATH Keywords

minimum degreeneighborhoodID-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

• A sufficient condition for graphs to have ID-Hamiltonian \([a,b]\)-factors
• scientific article; zbMATH DE number 5953644
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• Toughness for the existence of \(k\)-Hamiltonian \([a,b]\)-factors.
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors

Cited in

(1)

• A sufficient condition for graphs to have ID-Hamiltonian \([a,b]\)-factors

This page was built for publication: On ID-Hamiltonian \([a,b]\)-factor

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