Parity Subgraph, Shortest Cycle Cover, and Postman Tour

DOI10.1137/0406034MaRDI QIDQ3136614zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(5)

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

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)