On the Circuit Cover Problem for Mixed Graphs

DOI10.1017/S0963548301004989MaRDI QIDQ4330734zbMATH OpenOpenAlexFDO

Authors Orlando Lee, Yoshiko Wakabayashi

Publication date 14 May 2002

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548301004989

zbMATH Keywords

circuit cover problem for mixed graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On negative cycles in mixed graphs
• On the complexity of circulations
• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
• scientific article; zbMATH DE number 1189241
• Covering partially directed graphs with directed paths

Cited in

(7)

• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
• Proofs of two minimum circuit cover conjectures
• Covering partially directed graphs with directed paths
• scientific article; zbMATH DE number 5556019 (Why is no real title available?)
• scientific article; zbMATH DE number 1189241 (Why is no real title available?)
• Cycle-connected mixed graphs and related problems
• Computational complexity of the police officer patrol problem on weighted digraphs

This page was built for publication: On the Circuit Cover Problem for Mixed Graphs

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