Compatible Euler tours for transition systems in Eulerian graphs

DOI10.1016/0012-365X(87)90125-7zbMath0626.05035MaRDI QIDQ580368

Bill Jackson

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

1-factorHamiltonian cycleEulerian graphtransition systemcompatible Euler tours

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks ⋮ 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 ⋮ A characterisation of graphs having three pariwise compatible Euler tours ⋮ Compatible Eulerian circuits in \(K_ n^{**}\) ⋮ Embedding digraphs on orientable surfaces

Cites Work

• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compatible Euler tours for transition systems in Eulerian graphs