Extending perfect matchings to Hamiltonian cycles in line graphs
From MaRDI portal
Publication:2223459
DOI10.37236/9143zbMath1456.05093arXiv1910.01553OpenAlexW3119766805MaRDI QIDQ2223459
John Baptist Gauci, Domenico Labbate, Marién Abreu, Giuseppe Mazzuoccolo, Jean Paul Zerafa
Publication date: 29 January 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.01553
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items (4)
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 ⋮ Perfect matchings and Hamiltonicity in the Cartesian product of cycles
Cites Work
- A degree condition implying that every matching is contained in a Hamiltonian cycle
- Graphs with cycles having adjacent lines different colors
- Extending matchings in claw-free graphs
- Matchings extend to Hamiltonian cycles in 5-cube
- Graphs with Hamiltonian cycles having adjacent lines different colours
- Perfect matchings extend to Hamilton cycles in hypercubes
- A problem regarding the tracing of graphs
- Graphs with 1-Factors
- Reflections on graph theory
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Extending perfect matchings to Hamiltonian cycles in line graphs