Euler cycles in K₂m plus perfect matching

DOI10.1006/EUJC.1997.0165MaRDI QIDQ1289075zbMATH OpenOpenAlexFDO

Authors Tomáš Dvořák, Ivan Havel, Petr Liebl

Publication date 20 July 1999

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1997.0165

zbMATH Keywords

Euler cycleEulerian multigraphhomomorphismperfect matching

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Euler cycles in the complete graph \(K_{2m+1}\)
• scientific article; zbMATH DE number 1229694
• On the maximum number of pairwise compatible euler cycles
• A Construction of a perfect set of Euler tours of K2k+1

Cited in

(5)

• Euler cycles in the complete graph \(K_{2m+1}\)
• Perfect set of Euler tours of \(K_{p,p,p}\)
• On the maximum number of pairwise compatible euler cycles
• scientific article; zbMATH DE number 1229694 (Why is no real title available?)
• A Construction of a perfect set of Euler tours of K2k+1

This page was built for publication: Euler cycles in \(K_{2m}\) plus perfect matching

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