Publication details
Closure for the property of having a Hamiltonian prism
| Authors | |
|---|---|
| Year of publication | 2007 |
| Type | Peer-reviewed scientific article |
| Magazine / Source | Journal of Graph Theory |
| Citation | |
| Doi | https://doi.org/10.1002/jgt.20203 |
| Keywords | Hamilton cycles; prism of graphs; graph closures |
| Description | We prove that a graph G of order n has a hamiltonian prism if and only if the graph Cl4n/3-4/3(G) has a hamiltonian prism where Cl4n/3-4/3(G) is the graph obtained from G by sequential adding edges between non-adjacent vertices whose degree sum is at least 4n/3 - 4/3. We show that this cannot be improved to less than 4n/3 - 5. (c) 2006 Wiley Periodicals, Inc. |