scientific article
From MaRDI portal
Publication:3672016
zbMath0522.05041MaRDI QIDQ3672016
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eulerian graphenumeration problemssurvey articleChinese postman problemmazesalgorithms for finding an Eulerian trailcovering walksdecompositions into edge-disjoint circuitsEuler's characterization theoremEulerian trails in planar graphs
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45)
Related Items
An algorithm for an Eulerian trail traversing specified edges in given order ⋮ Mathematical models and routing algorithms for CAD technological preparation of cutting processes ⋮ Circuit extension and circuit double cover of graphs ⋮ Some results involving the splitting operation on binary matroids ⋮ Odd Decompositions of Eulerian Graphs ⋮ A note on immersion minors and planarity ⋮ Postman tours and cycle covers ⋮ Compatible Euler tours for transition systems in Eulerian graphs ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor ⋮ Circuit decompositions of Eulerian graphs ⋮ Splitting in a binary matroid