Covering the edges of a graph by circuits

DOI10.1007/BF01074821zbMATH Open0712.05036MaRDI QIDQ3496358FDOQ3496358

Authors: D. Ja. Kesel'man 

Publication date: 1987

Published in: Cybernetics (Search for Journal in Brave)

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

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)

Cites Work

• Covering Graphs by Simple Circuits
• Title not available (Why is that?)

Cited In (8)

• Postman tours and cycle covers
• Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Covering Arrays Avoiding Forbidden Edges
• Title not available (Why is that?)
• 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)