2-factors and Hamiltonicity

DOI10.1016/S0012-365X(98)00104-6zbMATH Open0958.05115MaRDI QIDQ1584422FDOQ1584422

Ingo Schiermeyer, Zdeněk Ryjáček

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)

Cites Work

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

Cited In (1)

• Maximal sets of 2-factors and Hamiltonian cycles

Recommendations

• Title not available (Why is that?) 👍 👎
• 2-factor Hamiltonian graphs. 👍 👎
• Hamilton cycle rich two-factorizations of complete graphs 👍 👎
• On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors 👍 👎
• Hamiltonian ?-factors in graphs 👍 👎
• Hamilton Decompositions and (n/2)-Factorizations of Hypercubes 👍 👎
• 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 👍 👎
• On 2-factor Hamiltonian regular bipartite graphs 👍 👎

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)