Vertex-transitive graphs that have no Hamilton decomposition
From MaRDI portal
Publication:2349515
DOI10.1016/j.jctb.2015.05.007zbMath1315.05073arXiv1408.5211MaRDI QIDQ2349515
Matthew Dean, Darryn E. Bryant
Publication date: 22 June 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.5211
05C38: Paths and cycles
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
On Hamilton decompositions of infinite circulant graphs, Properties, proved and conjectured, of Keller, Mycielski, and queen graphs, Some graph theoretical aspects of generalized truncations
Cites Work
- Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets
- Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two
- A refined classification of symmetric cubic graphs
- On Hamilton cycle decomposition of 6-regular circulant graphs
- Packing paths in complete graphs
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable
- On Hamilton decompositions of prisms over simple 3-polytopes
- Hamiltonian decomposition of Cayley graphs of degree 4
- Pairs of edge-disjoint Hamiltonian circuits
- Hamiltonian decompositions of Cayley graphs on Abelian groups
- Advances on the Hamiltonian problem -- a survey
- Hamiltonian decompositions of Cayley graphs on abelian groups of even order
- Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups
- Hamiltonian decompositions of Cayley graphs on abelian groups of odd order
- Cubic vertex-transitive graphs on up to 1280 vertices
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Hamilton cycle decomposition of 6-regular circulants of odd order
- Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
- Vertex‐Transitive Graphs of Prime‐Squared Order Are Hamilton‐Decomposable
- On automorphism groups of graph truncations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item