scientific article; zbMATH DE number 7053308
From MaRDI portal
Publication:5743429
zbMath1423.05053MaRDI QIDQ5743429
Ken-ichi Kawarabayashi, Kenta Ozeki
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095172
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 3-trees with few vertices of degree 3 in circuit graphs
- Graph minors. VII: Disjoint paths on a surface
- 4-connected projective planar graphs are Hamiltonian
- 2-walks in circuit graphs
- Subgraphs of graphs on surfaces with high representativity
- Worst-case comparison of valid inequalities for the TSP
- Nonhamiltonian triangulations with large connectivity and representativity
- Worst-case analysis of a new heuristic for the travelling salesman problem
- On the approximability of the traveling salesman problem
- Simple paths on polyhedra
- An upper bound on the length of a Hamiltonian walk of a maximal planar graph
- Contraction decomposition in h-minor-free graphs and algorithmic applications
- Trees in Polyhedral Graphs
- The Traveling-Salesman Problem and Minimum Spanning Trees
- On Hamiltonian Circuits
- A theorem on paths in planar graphs
This page was built for publication:
