Cycles containing matchings and pairwise compatible euler tours

DOI10.1002/jgt.3190140114zbMath0688.05050OpenAlexW1968753385MaRDI QIDQ4206766

Bill Jackson, Nicholas C. Wormald

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.3190140114

zbMATH Keywords

cyclematchingEulerian graphEuler tours

Mathematics Subject Classification ID

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

Related Items (10)

Bipartite graphs with every matching in a cycle ⋮ A degree condition for cycles passing through specified vertices and edges ⋮ Graphs with every matching contained in a cycle ⋮ 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 ⋮ A degree condition implying that every matching is contained in a Hamiltonian cycle ⋮ On 2-factors containing 1-factors in bipartite graphs ⋮ Compatible Eulerian circuits in \(K_ n^{**}\) ⋮ Hamiltonian cycles and paths through matchings

Cites Work

• On the maximum number of pairwise compatible euler cycles

This page was built for publication: Cycles containing matchings and pairwise compatible euler tours