Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
From MaRDI portal
Publication:5881007
DOI10.26493/1855-3974.2672.73bOpenAlexW4306944861MaRDI QIDQ5881007
Jean Paul Zerafa, Marién Abreu, Federico Romaniello, John Baptist Gauci, Domenico Labbate
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 2-factor Hamiltonian graphs.
- On minimally one-factorable \(r\)-regular bipartite 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
- On 3-cut reductions of minimally 1-factorable cubic bigraphs