In the paper, the necessary and sufficient conditions of existence of a Hamiltonian cycle in a graph are investigated. It is proven that a graph is Hamiltonian if andonly if the number of elemetns in any independent set of its vertices does not exceed the number of vertices in the minimum separating set for the paths connecting these independent vertices.
Reliable Computing – Springer Journals
Published: Oct 6, 2004
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud