z-logo
Premium
Vertex‐Transitive Graphs of Prime‐Squared Order Are Hamilton‐Decomposable
Author(s) -
Alspach Brian,
Bryant Darryn,
Kreher Donald L.
Publication year - 2014
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.21381
Subject(s) - mathematics , combinatorics , transitive relation , vertex (graph theory) , prime (order theory) , order (exchange) , discrete mathematics , graph , finance , economics
We prove that all connected vertex‐transitive graphs of order p 2 , p a prime, can be decomposed into Hamilton cycles.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom