scientific article; zbMATH DE number 3912424
From MaRDI portal
Publication:3689218
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Eulerian and Hamiltonian graphs (05C45) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Inventory, storage, reservoirs (90B05) Programming involving graphs or networks (90C35)
Recommendations
Cited in
(40)- A new formulation for the traveling deliveryman problem
- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem
- Detecting Hamiltonian cycles
- An extension of the multi-path algorithm for finding Hamilton cycles
- On the complexity of recognizing tough graphs
- A closure concept based on neighborhood unions of independent triples
- Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
- The complexity of recognizing tough cubic graphs
- Better approximations of non-Hamiltonian graphs
- The hidden algorithm of Ore's theorem on Hamiltonian cycles
- Hamiltonian cycles in polyhedral maps
- Hamiltonicity of locally Hamiltonian and locally traceable graphs
- A simple linear expected time algorithm for finding a Hamilton path
- Parallel graph algorithms that are efficients on average
- Hamiltonian degree conditions for tough graphs
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs
- On strictly chordality-\(k\) graphs
- Geometric biplane graphs. II: Graph augmentation
- On certain Hamiltonian inner triangulations
- Hamiltonian cycles existed in plan of polyhedron
- To be or not to be Yutsis
- scientific article; zbMATH DE number 4004218 (Why is no real title available?)
- scientific article; zbMATH DE number 4010558 (Why is no real title available?)
- scientific article; zbMATH DE number 4073021 (Why is no real title available?)
- scientific article; zbMATH DE number 4075117 (Why is no real title available?)
- scientific article; zbMATH DE number 44783 (Why is no real title available?)
- Drawing Hamiltonian cycles with no large angles
- Finding hidden hamiltonian cycles
- scientific article; zbMATH DE number 2199618 (Why is no real title available?)
- scientific article; zbMATH DE number 2230266 (Why is no real title available?)
- Approximation of coNP sets by NP-complete sets
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Graphs generalizing closed curves with linear construction of the Hamiltonian cycle
- To be or not to be Yutsis: algorithms for the decision problem
- Toughness and Delaunay triangulations
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- Connectivity of plane triangulations
- Recognizing tough graphs is NP-hard
- Finding Hamiltonian circuits in quasi-adjoint graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689218)
