scientific article
From MaRDI portal
Publication:3734435
zbMath0599.05035MaRDI QIDQ3734435
Meigu Guan, Herbert Fleischner
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pathsCPPplanar graphsChinese Postman ProblemMinimum Weighted Cycle Covering Problemplanar bridgeless graphs
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface ⋮ Integer flows and cycle covers ⋮ Cycle covers of cubic multigraphs ⋮ Postman tours and cycle covers ⋮ Graphs with the Circuit Cover Property ⋮ Circuit decompositions of Eulerian graphs ⋮ Shortest coverings of graphs with cycles ⋮ Proof of the strong 2-cover conjecture for planar graphs
This page was built for publication:
