Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4

DOI10.1137/0219044MaRDI QIDQ3474885zbMATH OpenOpenAlexFDO

Authors Bill Jackson

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

zbMATH Keywords

Chinese postman problemshortest circuit covers

Mathematics Subject Classification ID

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)

Recommendations

• Minimum cycle coverings and integer flows
• Postman tours and cycle covers
• Cycle covers of graphs with a nowhere-zero 4-flow
• Note on integer 4-flows in graphs
• Shorter signed circuit covers of graphs

Cited in

(13)

• Postman tours and cycle covers
• Graphs with the Circuit Cover Property
• On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
• A note about shortest cycle covers
• A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface
• Shortest circuit covers of signed graphs
• Covering a graph with cycles.
• Cycle covers of graphs with a nowhere-zero 4-flow
• Smallest (1, 2)‐eulerian weight and shortest cycle covering
• Shipper collaboration
• Nowhere zero flow and circuit covering in regular matroids
• Proofs of two minimum circuit cover conjectures
• Note on integer 4-flows in graphs

This page was built for publication: Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474885)