Compatible Euler tours for transition systems in Eulerian graphs
From MaRDI portal
(Redirected from Publication:580368)
Recommendations
Cites work
- 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?)
- Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
Cited in
(14)- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- scientific article; zbMATH DE number 15460 (Why is no real title available?)
- scientific article; zbMATH DE number 4068916 (Why is no real title available?)
- Compatible Euler tours and supplementary Eulerian vectors
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
- Covering 2-paths uniformly
- Embedding digraphs on orientable surfaces
- A characterisation of graphs having three pariwise compatible Euler tours
- scientific article; zbMATH DE number 3896973 (Why is no real title available?)
- scientific article; zbMATH DE number 903086 (Why is no real title available?)
- Compatible Eulerian circuits in \(K_ n^{**}\)
- On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks
- Triangle-free Eulerian tours in graphs with maximum degree at most 4
- 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)
