Compatible path-cycle-decompositions of plane graphs

DOI10.1016/0095-8956(87)90066-9zbMath0605.05023OpenAlexW2050405728MaRDI QIDQ1084113

Herbert Fleischner, Bill Jackson

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90066-9

zbMATH Keywords

transitionsEuler trailpath-cycle-decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Separating codes and traffic monitoring ⋮ Finding paths in graphs avoiding forbidden transitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
• Removable Cycles in Planar Graphs
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four

This page was built for publication: Compatible path-cycle-decompositions of plane graphs