Pages that link to "Item:Q2452378"
From MaRDI portal
The following pages link to The traveling salesman problem on cubic and subcubic graphs (Q2452378):
Displaying 22 items.
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- Avoiding 7-circuits in 2-factors of cubic graphs (Q470948) (← links)
- Graphs with a 3-cycle-2-cover (Q897268) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Simple cubic graphs with no short traveling salesman tour (Q1752607) (← links)
- Improved approximations for cubic bipartite and cubic TSP (Q1801011) (← links)
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem (Q2090221) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- Lai's conditions for spanning and dominating closed trails (Q2260637) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
- Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
- Cubic TSP: A 1.3-Approximation (Q4581212) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- Perfect Matchings of Regular Bipartite Graphs (Q5272932) (← links)
- On Dominating Even Subgraphs in Cubic Graphs (Q5346564) (← links)
- Avoiding 5-Circuits in 2-Factors of Cubic Graphs (Q5502100) (← links)
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals (Q6535280) (← links)