Compatible path-cycle-decompositions of plane graphs
- 1 February 1987
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 42 (1) , 94-121
- https://doi.org/10.1016/0095-8956(87)90066-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Removable Cycles in Planar GraphsJournal of the London Mathematical Society, 1985
- Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeidenJournal of Combinatorial Theory, Series B, 1980
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least FourJournal of the London Mathematical Society, 1980
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von PetersenMonatshefte für Mathematik, 1976