The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle

DOI10.1016/S0012-365X(02)00566-6zbMATH Open1017.05068MaRDI QIDQ1869211FDOQ1869211

Authors: A. Benkouar, Y. Manoussakis, Rachid Saad 

Publication date: 9 April 2003

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

Recommendations

• Alternating hamiltonian cycles in two colored complete bipartite graphs
• Alternating Hamiltonian circuits in edge-coloured bipartite graphs
• scientific article; zbMATH DE number 718675
• scientific article; zbMATH DE number 54775
• Alternating Hamiltonian cycles

zbMATH Keywords

Hamiltonian cyclescomplete graphsalternating cycles

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Cited In (4)

• Alternating paths in edge-colored complete graphs
• Parallel connectivity in edge-colored complete graphs: complexity results
• Paths and trails in edge-colored graphs
• Paths and Trails in Edge-Colored Graphs

This page was built for publication: The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle

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