scientific article; zbMATH DE number 3825852
From MaRDI portal
Publication:3672016
zbMATH Open0522.05041MaRDI QIDQ3672016FDOQ3672016
Authors: Herbert Fleischner 
Publication date: 1983
Title of this publication is not available (Why is that?)
Chinese postman problemEulerian graphsurvey articleenumeration problemsmazesalgorithms 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)
Cited In (12)
- Odd Decompositions of Eulerian Graphs
- Postman tours and cycle covers
- A note on immersion minors and planarity
- Compatible Euler tours for transition systems in Eulerian graphs
- Splitting in a binary matroid
- Bidirectional retracting-free double tracings and upper embeddability of graphs
- Circuit decompositions of Eulerian graphs
- An algorithm for an Eulerian trail traversing specified edges in given order
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes
- Some results involving the splitting operation on binary matroids
- Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor
- Circuit extension and circuit double cover of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3672016)
