A characterisation of graphs having three pariwise compatible Euler tours

DOI10.1016/0095-8956(91)90054-NzbMath0689.05038MaRDI QIDQ1264154

Bill Jackson

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

line graphEuler toursisotropic systemsedge-disjoint Hamilton circuits

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

3-manifolds represented by 4-regular graphs with three Eulerian cycles ⋮ Coverings and delta-coverings ⋮ On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions ⋮ Supplementary Eulerian vectors in isotropic systems ⋮ Circle graphs and the cycle double cover conjecture

Cites Work

• Compatible Euler tours for transition systems in Eulerian graphs
• The 1-factorization of some line-graphs
• Isotropic systems
• Graphic presentations of isotropic systems
• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Supplementary Eulerian vectors in isotropic systems
• Compatible Euler tours and supplementary Eulerian vectors
• On the maximum number of pairwise compatible euler cycles
• Cycles containing matchings and pairwise compatible euler tours
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterisation of graphs having three pariwise compatible Euler tours