Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs
From MaRDI portal
Publication:2352793
DOI10.1016/j.dam.2015.03.017zbMath1316.05077OpenAlexW2106730442MaRDI QIDQ2352793
Publication date: 6 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.03.017
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Paths and cycles (05C38)
Related Items
Hierarchical Chinese postman problem with fuzzy travel times ⋮ Largest 2-regular subgraphs in 3-regular graphs
Cites Work