Even circuits in planar graphs
From MaRDI portal
Publication:1168333
DOI10.1016/0095-8956(81)90034-4zbMath0493.05041MaRDI QIDQ1168333
Publication date: 1981
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(81)90034-4
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
Related Items
On even circuit decompositions of eulerian graphs, Smallest (1, 2)‐eulerian weight and shortest cycle covering, Graphs with the Circuit Cover Property, Triangle-free circuit decompositions and Petersen minor, The construction and reduction of strong snarks, Circuit decompositions of Eulerian graphs, On circuit decomposition of planar Eulerian graphs