Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
From MaRDI portal
Publication:3474885
DOI10.1137/0219044zbMath0697.68040MaRDI QIDQ3474885
Publication date: 1990
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0219044
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
94C15: Applications of graph theory to circuits and networks
Related Items
Smallest (1, 2)‐eulerian weight and shortest cycle covering, Graphs with the Circuit Cover Property, Postman tours and cycle covers, Shipper collaboration, Covering a graph with cycles., On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks, Proofs of two minimum circuit cover conjectures, A note about shortest cycle covers, A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface, Cycle covers of graphs with a nowhere-zero 4-flow