Euler cycles in the complete graph \(K_{2m+1}\)

DOI10.1016/S0012-365X(96)00074-XzbMath0881.05085OpenAlexW2085586425MaRDI QIDQ1363690

Tomáš Dvořák, Petr Liebl, Ivan M. Havel

Publication date: 10 August 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00074-x

zbMATH Keywords

decompositionharmonious chromatic numbercomplete graphEuler cycle

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items

The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs

Cites Work

• Decomposition of a complete graph into trails of given lengths
• Decompositions En Chaines D'un Graphe Complet D'ordre Impair
• An upper bound for the harmonious chromatic number of a graph
• Unnamed Item