Postman tours and cycle covers

DOI10.1016/0012-365X(93)90182-SzbMath0787.05078MaRDI QIDQ686511

Andre Raspaud

Publication date: 20 December 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

postman tourshortest circuit cover

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Shortest coverings of graphs with cycles
• Cycle covering in bridgeless graphs
• Minimum cycle coverings and integer flows
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
• On the chromatic number of binary matroids
• Covering Graphs by Simple Circuits
• Graphs with the Circuit Cover Property
• Matching, Euler tours and the Chinese postman
• On the algebraic theory of graph colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Postman tours and cycle covers