Parity Subgraph, Shortest Cycle Cover, and Postman Tour

DOI10.1137/0406034zbMATH Open0786.05052OpenAlexW1980438884MaRDI QIDQ3136614FDOQ3136614

Authors: Cun-Quan Zhang 

Publication date: 14 October 1993

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

Full work available at URL: https://doi.org/10.1137/0406034

Recommendations

• Postman tours and cycle covers
• Minimum cycle coverings and integer flows
• Parity and disparity subgraphs
• A note about shortest cycle covers
• scientific article; zbMATH DE number 475603

zbMATH Keywords

parity subgraphcycle coverspostman tour

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Postman tours and cycle covers
• The parity Hamiltonian cycle problem in directed graphs
• On the length of the Chinese postman tour in homogeneous graphs
• Parity and disparity subgraphs
• The parity Hamiltonian cycle problem

This page was built for publication: Parity Subgraph, Shortest Cycle Cover, and Postman Tour

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