Compatible Euler tours for transition systems in Eulerian graphs

DOI10.1016/0012-365X(87)90125-7zbMATH Open0626.05035MaRDI QIDQ580368FDOQ580368

Authors: Bill Jackson 

Publication date: 1987

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

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^{**}\)

zbMATH Keywords

Hamiltonian cycleEulerian graph1-factortransition systemcompatible Euler tours

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
• Compatible Euler tours and supplementary Eulerian vectors
• Covering 2-paths uniformly
• Embedding digraphs on orientable surfaces
• A characterisation of graphs having three pariwise compatible Euler tours
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)