Spanning trees with specified differences in Cayley graphs

DOI10.1016/J.DISC.2011.09.007MaRDI QIDQ442368zbMATH OpenOpenAlexFDO

Authors Ben Seamone, Brett Stevens

Publication date 10 August 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.09.007

zbMATH Keywords

Hamiltonian pathCayley graphspanning treeedge-labeled treelabeled matroid

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of matroids and geometric lattices (05B35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Rainbow spanning trees in abelian groups
• Cayley graphs of order \(27p\) are Hamiltonian
• Cayley graphs of abelian groups are edge-Hamiltonian
• Multicolored spanning subgraphs in \(G\)-colorings of complete graphs.
• Cayley graphs on groups with commutator subgroup of order \(2p\) are Hamiltonian

Cites work

• scientific article; zbMATH DE number 4214018 (Why is no real title available?)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• A THEOREM ON INDEPENDENCE RELATIONS
• Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
• On Hamiltonian paths with prescribed edge lengths in the complete graph
• On a problem of Marco Buratti

Cited in

(4)

• Rainbow spanning trees in abelian groups
• A new result on the problem of Buratti, Horak and Rosa
• Graph-Theoretic Concepts in Computer Science
• Additive list coloring of planar graphs with given girth

This page was built for publication: Spanning trees with specified differences in Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442368)