Covering the edges of a graph by circuits

DOI10.1007/BF01074821MaRDI QIDQ3496358zbMATH OpenFDO

Authors D. Ja. Kesel'man

Publication date 1987

Published in Cybernetics (Search for Journal in Brave)

zbMATH Keywords

minimum total lengthcovercircuitsChinese postman

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transportation, logistics and supply chain management (90B06)

Recommendations

• Postman tours and cycle covers
• scientific article; zbMATH DE number 3880464
• scientific article; zbMATH DE number 3966112
• Approximation algorithms for some minimum postmen cover problems
• scientific article; zbMATH DE number 4211828

Cites work

• scientific article; zbMATH DE number 3338382 (Why is no real title available?)
• Covering Graphs by Simple Circuits

Cited in

(8)

• scientific article; zbMATH DE number 3966112 (Why is no real title available?)
• scientific article; zbMATH DE number 3231691 (Why is no real title available?)
• Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
• Covering Arrays Avoiding Forbidden Edges
• scientific article; zbMATH DE number 1843998 (Why is no real title available?)
• Postman tours and cycle covers
• Erratum to: ``Approximating the length of Chinese postman tours
• Minimal cut cover of a graph with an application to the testing of electronic boards

This page was built for publication: Covering the edges of a graph by circuits

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