Adjacency on the Postman Polyhedron

DOI10.1137/0602021zbMath0498.05042OpenAlexW2071100042MaRDI QIDQ3963041

Rick Giles

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602021

zbMATH Keywords

diametertravelling salesman problemneighbourhoodpostman set

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items (3)

On the cycle polytope of a binary matroid ⋮ Adjacency on polymatroids ⋮ Parity and disparity subgraphs

Cites Work

• Unnamed Item
• On certain polytopes associated with graphs
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• The travelling salesman problem and a class of polyhedra of diameter two
• Matching, Euler tours and the Chinese postman
• Paths, Trees, and Flowers

This page was built for publication: Adjacency on the Postman Polyhedron