Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs

DOI10.37236/10988OpenAlexW4362599212MaRDI QIDQ2699653

Federico Romaniello, Jean Paul Zerafa

Publication date: 19 April 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.03060

zbMATH Keywords

cubic graph2-factor Hamiltonian graph

Mathematics Subject Classification ID

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching structure and the matching lattice
• On \(F\)-Hamiltonian graphs
• 2-factor Hamiltonian graphs.
• Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
• Perfect matchings and Hamiltonicity in the Cartesian product of cycles
• Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
• Extending perfect matchings to Hamiltonian cycles in line graphs
• Perfect matchings extend to Hamilton cycles in hypercubes
• Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
• On 3-cut reductions of minimally 1-factorable cubic bigraphs

This page was built for publication: Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs