Hamiltonian cycles in \(n\)-factor-critical graphs

DOI10.1016/S0012-365X(00)00386-1zbMath0983.05058OpenAlexW2075152993WikidataQ126562948 ScholiaQ126562948MaRDI QIDQ5948969

Katsuhiro Ota, Akira Saito, Ken-ichi Kawarabayashi

Publication date: 16 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00386-1

zbMATH Keywords

Hamiltonian cycledegree sumfactor-critical graphstoughness

Mathematics Subject Classification ID

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

Related Items (1)

Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles

This page was built for publication: Hamiltonian cycles in \(n\)-factor-critical graphs