Even circuits in planar graphs
- 1 December 1981
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 31 (3) , 327-338
- https://doi.org/10.1016/0095-8956(81)90034-4
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeidenJournal of Combinatorial Theory, Series B, 1980
- Polyhedral decompositions of cubic graphsBulletin of the Australian Mathematical Society, 1973