On perfectly one–factorable cubic graphs

DOI10.1016/j.endm.2006.06.008zbMath1201.05044OpenAlexW2052548347MaRDI QIDQ3439410

Simona Bonvicini, Giuseppe Mazzuoccolo

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.008

zbMATH Keywords

Hamiltonian cyclesfactorizationscubic graphsone

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
• The classification of Hamiltonian generalized Petersen graphs
• 2-factor Hamiltonian graphs.
• Every generalized Petersen graph has a Tait coloring
• A theorem on tait colorings with an application to the generalized Petersen graphs
• On Hamiltonian Circuits

This page was built for publication: On perfectly one–factorable cubic graphs