2-factors and Hamiltonicity

DOI10.1016/S0012-365X(98)00104-6MaRDI QIDQ1584422zbMATH OpenFDO

Authors Zdeněk Ryjáček, Ingo Schiermeyer

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamilton cycle2-factor

Mathematics Subject Classification ID

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

Recommendations

• Publication:5463502
• 2-factors with \(k\) cycles in Hamiltonian graphs
• Maximal sets of 2-factors and Hamiltonian cycles
• On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles
• 2-factor Hamiltonian graphs.
• On the Hamilton-Waterloo problem for bipartite 2-factors
• Hamiltonian ?-factors in graphs
• On 2-factor Hamiltonian regular bipartite graphs
• Hamilton Decompositions and (n/2)-Factorizations of Hypercubes
• Hamilton cycle rich two-factorizations of complete graphs

Cites work

• A comparison of some conditions for non-hamiltonicity of graphs
• An algorithmic proof of Tutte's f-factor theorem
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Graph theory
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors

Cited in

(2)

• Forbidden subgraphs for existences of (connected) 2-factors of a graph
• Maximal sets of 2-factors and Hamiltonian cycles

This page was built for publication: 2-factors and Hamiltonicity

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