Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

The Chinese Postman Problem in a multigraph is the problem of finding a shortest closed walk traversing all the edges. In a (2r+1)-regular multigraph, the problem is equivalent to finding a smallest spanning subgraph in which all vertices have odd degree. In 1994, Kostochka and Tulai established a sharp upper bound for the solution. In this paper, we give simple proofs of their bounds for 3-regular graphs and 3-regular multigraphs and characterize when equality holds in those cases. We conjecture that a more specific construction characterizes equality for 2.

Cite

CITATION STYLE

APA

Suil, O., & West, D. B. (2015). Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs. Discrete Applied Mathematics, 190191, 163–168. https://doi.org/10.1016/j.dam.2015.03.017

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free