Euler cycles in the complete graph K₂m+1

DOI10.1016/S0012-365X(96)00074-XzbMATH Open0881.05085OpenAlexW2085586425MaRDI QIDQ1363690FDOQ1363690

Authors: Tomáš Dvořák, Petr Liebl, Ivan 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

Recommendations

• Euler cycles in \(K_{2m}\) plus perfect matching
• Cycles, Eulerian digraphs and the Schönemann-Gauss theorem
• Eulerian cycle decomposition conjecture for the line graph of complete graphs
• A cycle decomposition conjecture for Eulerian graphs
• scientific article; zbMATH DE number 2145386
• \(k\)-cyclic even cycle systems of the complete graph
• On the Eulerian cycle decomposition conjecture and complete multipartite graphs
• Eulerian straight ahead cycles in drawings of complete bipartite graphs
• Cycles through \(k+2\) vertices in \(k\)-connected graphs
• A special construction of complete Euler graphs

zbMATH Keywords

decompositioncomplete graphharmonious chromatic numberEuler cycle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An upper bound for the harmonious chromatic number of a graph
• Decomposition of a complete graph into trails of given lengths
• Decompositions En Chaines D'un Graphe Complet D'ordre Impair

Cited In (3)

• A Construction of a perfect set of Euler tours of K2k+1
• Perfect set of Euler tours of \(K_{p,p,p}\)
• The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs

This page was built for publication: Euler cycles in the complete graph \(K_{2m+1}\)

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