Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
From MaRDI portal
Publication:2172396
DOI10.1016/j.dam.2022.06.040zbMath1497.05217arXiv2011.04327OpenAlexW4283837988MaRDI QIDQ2172396
John Baptist Gauci, Jean Paul Zerafa
Publication date: 15 September 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.04327
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs, Neighborhood balanced colorings of graphs, Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On isomorphism between circulant and Cartesian product of 2 cycles
- On planarity and colorability of circulant graphs
- Perfect 1-factorisations of circulants with small degree
- Perfect matchings and Hamiltonicity in the Cartesian product of cycles
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Perfect matchings extend to Hamilton cycles in hypercubes
- Circulants and their connectivities