Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs

DOI10.26493/1855-3974.2672.73BMaRDI QIDQ5881007zbMATH OpenOpenAlexFDO

Authors M. Abreu, John Baptist Gauci, Federico Romaniello, Jean Paul Zerafa, D. Labbate

Publication date 9 March 2023

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

3-edge-colouringcubic graphHamiltonian cycleperfect matching

Mathematics Subject Classification ID

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

Recommendations

• Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
• Three matching intersection property for matching covered graphs
• scientific article; zbMATH DE number 1916558
• scientific article; zbMATH DE number 1916568
• A characterization of PM-compact claw-free cubic graphs

Cites work

• 2-factor Hamiltonian graphs.
• Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
• Characterizing minimally 1-factorable r-regular bipartite graphs
• Extending a perfect matching to a Hamiltonian cycle
• Extending perfect matchings to Hamiltonian cycles in line graphs
• scientific article; zbMATH DE number 3722690 (Why is no real title available?)
• scientific article; zbMATH DE number 1985430 (Why is no real title available?)
• scientific article; zbMATH DE number 227006 (Why is no real title available?)
• On 3-cut reductions of minimally 1-factorable cubic bigraphs
• On minimally one-factorable r-regular bipartite graphs
• Perfect matchings and Hamiltonicity in the Cartesian product of cycles

Cited in

(6)

• Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
• Extending perfect matchings to Hamiltonian cycles in line graphs
• Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
• Perfect 3-colorings of the cubic graphs of order 10
• The Gray graph is pseudo 2-factor isomorphic

This page was built for publication: Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs

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