Compatible Euler tours for transition systems in Eulerian graphs

DOI10.1016/0012-365X(87)90125-7MaRDI QIDQ580368zbMATH OpenFDO

Authors Bill Jackson

Publication date 1987

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(87)90125-7

zbMATH Keywords

1-factorcompatible Euler toursEulerian graphHamiltonian cycletransition system

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 15460
• A characterisation of graphs having three pariwise compatible Euler tours
• Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
• Compatible Euler tours of \(K_n^{**}\)

Cites work

• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• scientific article; zbMATH DE number 3825852 (Why is no real title available?)
• scientific article; zbMATH DE number 3722690 (Why is no real title available?)
• scientific article; zbMATH DE number 3249675 (Why is no real title available?)

Cited in

(15)

• A characterisation of graphs having three pariwise compatible Euler tours
• Compatible Euler tours and supplementary Eulerian vectors
• On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks
• Compatible Euler tours of \(K_n^{**}\)
• Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
• Triangle-free Eulerian tours in graphs with maximum degree at most 4
• Compatible Eulerian circuits in \(K_ n^{**}\)
• Embedding digraphs on orientable surfaces
• Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
• scientific article; zbMATH DE number 3896973 (Why is no real title available?)
• scientific article; zbMATH DE number 4068916 (Why is no real title available?)
• scientific article; zbMATH DE number 15460 (Why is no real title available?)
• scientific article; zbMATH DE number 903086 (Why is no real title available?)
• Covering 2-paths uniformly
• A special construction of complete Euler graphs

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

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