Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
From MaRDI portal
Publication:3474885
DOI10.1137/0219044zbMath0697.68040OpenAlexW2032034839MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15)
Related Items (11)
Shortest circuit covers of signed graphs ⋮ 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 ⋮ Smallest (1, 2)‐eulerian weight and shortest cycle covering ⋮ Shipper collaboration ⋮ Covering a graph with cycles. ⋮ On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks ⋮ Postman tours and cycle covers ⋮ Graphs with the Circuit Cover Property ⋮ Proofs of two minimum circuit cover conjectures ⋮ A note about shortest cycle covers
This page was built for publication: Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
