On the maximum number of pairwise compatible euler cycles
From MaRDI portal
Publication:3478428
DOI10.1002/JGT.3190140106zbMATH Open0701.05033OpenAlexW2084009046MaRDI QIDQ3478428FDOQ3478428
A. J. W. Hilton, Herbert Fleischner, Bill Jackson
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
Recommendations
- Cycles containing matchings and pairwise compatible euler tours
- Euler cycles in \(K_{2m}\) plus perfect matching
- A cycle decomposition conjecture for Eulerian graphs
- Extremal numbers of cycles revisited
- Cycles, Eulerian digraphs and the Schönemann-Gauss theorem
- scientific article; zbMATH DE number 2015222
- On the Eulerian cycle decomposition conjecture and complete multipartite graphs
- scientific article; zbMATH DE number 1151855
- The Extremal Number of Tight Cycles
- A new upper bound on extremal number of even cycles
Cited In (12)
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
- Compatible Euler tours and supplementary Eulerian vectors
- Covering 2-paths uniformly
- Cycles containing matchings and pairwise compatible euler tours
- Embedding digraphs on orientable surfaces
- 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
- Compatible Eulerian circuits in \(K_ n^{**}\)
- Eulerian straight ahead cycles in drawings of complete bipartite graphs
- Euler tours of maximum girth in \(K_{2n+1}\) and \(K_{2n,2n}\)
- Compatible path-cycle-decompositions of plane graphs
This page was built for publication: On the maximum number of pairwise compatible euler cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3478428)
