Perfect matchings and Hamiltonicity in the Cartesian product of cycles
From MaRDI portal
Publication:1981010
DOI10.1007/s00026-021-00548-1zbMath1472.05126arXiv2005.02913MaRDI QIDQ1981010
John Baptist Gauci, Jean Paul Zerafa
Publication date: 9 September 2021
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.02913
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
05C76: Graph operations (line graphs, products, etc.)
Related Items
Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs, Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants, Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A degree condition implying that every matching is contained in a Hamiltonian cycle
- On \(F\)-Hamiltonian graphs
- Matchings extend to Hamiltonian cycles in 5-cube
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Perfect matchings extend to Hamilton cycles in hypercubes
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $