scientific article
From MaRDI portal
Publication:3689218
zbMath0572.05043MaRDI QIDQ3689218
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Eulerian and Hamiltonian graphs (05C45)
Related Items
On certain Hamiltonian inner triangulations, Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete, Hamiltonian degree conditions for tough graphs, The complexity of recognizing tough cubic graphs, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Better approximations of non-Hamiltonian graphs, On strictly chordality-\(k\) graphs, Approximation of coNP sets by NP-complete sets, Hamiltonicity of locally Hamiltonian and locally traceable graphs, Connectivity of plane triangulations, Hamiltonian properties of locally connected graphs with bounded vertex degree, Recognizing tough graphs is NP-hard, A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem, Finding Hamiltonian circuits in quasi-adjoint graphs, To be or not to be Yutsis: algorithms for the decision problem, The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs, A new formulation for the traveling deliveryman problem, Unnamed Item, Parallel graph algorithms that are efficients on average, Geometric biplane graphs. II: Graph augmentation, Toughness and Delaunay triangulations, To be or not to be Yutsis, On the complexity of recognizing tough graphs, A closure concept based on neighborhood unions of independent triples, An upper bound on the shortness exponent of 1-tough, maximal planar graphs
