Covering partially directed graphs with directed paths

DOI10.1016/J.DISC.2006.01.024zbMATH Open1093.05056OpenAlexW1993546945MaRDI QIDQ2497477FDOQ2497477

Authors: Romeo Rizzi, Marco Rospocher 

Publication date: 4 August 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.01.024

Recommendations

• Paths and circuits in partially directed graphs
• On the Circuit Cover Problem for Mixed Graphs
• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
• Algorithms and Computation
• Chinese postman problem on edge-colored multigraphs

zbMATH Keywords

mixed Chinese postman problemgood characterization\(b\)-factorpartially directed graphs

Mathematics Subject Classification ID

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

Cites Work

• Matching, Euler tours and the Chinese postman
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Maximum matching and a polyhedron with 0,1-vertices
• Title not available (Why is that?)
• A strongly polynomial minimum cost circulation algorithm
• A strongly polynomial algorithm for the transportation problem
• On the complexity of edge traversing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paths and circuits in partially directed graphs

Cited In (2)

• On the Circuit Cover Problem for Mixed Graphs
• Title not available (Why is that?)

This page was built for publication: Covering partially directed graphs with directed paths

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