Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle - MaRDI portal

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

From MaRDI portal

Publication:1869211

Jump to:navigation, search

DOI10.1016/S0012-365X(02)00566-6zbMath1017.05068MaRDI QIDQ1869211

Yannis Manoussakis, A. Benkouar, Rachid Saad

Publication date: 9 April 2003

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

zbMATH Keywords

Hamiltonian cycles complete graphs alternating cycles

Mathematics Subject Classification ID

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

Related Items (4)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1869211&oldid=14258680"