On the maximum number of pairwise compatible euler cycles

DOI10.1002/jgt.3190140106zbMath0701.05033OpenAlexW2084009046MaRDI QIDQ3478428

Bill Jackson, Anthony J. W. Hilton, Herbert Fleischner

Publication date: 1990

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140106

zbMATH Keywords

Eulerian graphcycle decomposition2-factors1-factors

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Covering 2-paths uniformly ⋮ Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems ⋮ On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions ⋮ A characterisation of graphs having three pariwise compatible Euler tours ⋮ Cycles containing matchings and pairwise compatible euler tours ⋮ Embedding digraphs on orientable surfaces

This page was built for publication: On the maximum number of pairwise compatible euler cycles