The Hamiltonian Cycle Problem and Monotone Classes
Vadim LozinAuthors Info & ClaimsAbstract
References
Recommendations
Distributing vertices along a Hamiltonian cycle in Dirac graphs
A graph G on n vertices is called a Dirac graph if it has a minimum degree of at least n/2. The distance dist"G(u,v) is defined as the number of edges in a shortest path of G joining u and v. In this paper we show that in a Dirac graph G, for every ...
Hamiltonian cycles in linear-convex supergrid graphs
A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle problem for grid and triangular ...
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
Finding a Hamiltonian cycle in a graph is one of the classical NP-complete problems. Complexity of the Hamiltonian problem in permutation graphs has been a well-known open problem. In this paper the authors settle the complexity of the Hamiltonian ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in