The following pages link to (Q3689218):
Displaying 25 items.
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- To be or not to be Yutsis: algorithms for the decision problem (Q709830) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem (Q1178723) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- A closure concept based on neighborhood unions of independent triples (Q1313822) (← links)
- Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete (Q1341680) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Hamiltonicity of locally Hamiltonian and locally traceable graphs (Q1693140) (← links)
- Parallel graph algorithms that are efficients on average (Q1825648) (← links)
- Hamiltonian degree conditions for tough graphs (Q1896350) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs (Q2026347) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- On certain Hamiltonian inner triangulations (Q2367404) (← links)
- To be or not to be Yutsis (Q3439167) (← links)
- (Q5708558) (← links)
- Approximation of coNP sets by NP-complete sets (Q6064009) (← links)
