Pages that link to "Item:Q3773723"
From MaRDI portal
The following pages link to The traveling salesman problem in graphs with 3-edge cutsets (Q3773723):
Displaying 20 items.
- The projected faces property and polyhedral relations (Q263204) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- On cuts and matchings in planar graphs (Q688915) (← links)
- Locating facilities which interact: Some solvable cases (Q689235) (← links)
- Subclasses of solvable problems from classes of combinatorial optimization problems (Q1040379) (← links)
- Decomposition and optimization over cycles in binary matroids (Q1089347) (← links)
- Hamiltonian properties of Toeplitz graphs (Q1126180) (← links)
- The traveling salesman problem in graphs with some excluded minors (Q1184343) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Complete linear descriptions of small asymmetric traveling salesman polytopes (Q1900146) (← links)
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- Persistency in the traveling salesman problem on Halin graphs (Q2725186) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- Plane Triangulations Without a Spanning Halin Subgraph II (Q4588847) (← links)
- Halin graphs and the travelling salesman problem (Q4744083) (← links)
- (Q5075801) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)
