Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
DOI10.26493/1855-3974.2672.73BOpenAlexW4306944861MaRDI QIDQ5881007FDOQ5881007
Jean Paul Zerafa, M. Abreu, D. Labbate, Federico Romaniello, John Baptist Gauci
Publication date: 9 March 2023
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.00513
Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 2-factor Hamiltonian graphs.
- On minimally one-factorable \(r\)-regular bipartite graphs
- Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
- On 3-cut reductions of minimally 1-factorable cubic bigraphs
- Perfect matchings and Hamiltonicity in the Cartesian product of cycles
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
Cited In (3)
Recommendations
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)