Hamiltonian square-paths (Q1924142)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 934809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian square-paths |
scientific article; zbMATH DE number 934809 |
Statements
Hamiltonian square-paths (English)
0 references
14 October 1996
0 references
It is shown that if the minimum degree of a graph \(G\) on \(n\) vertices is at least \((2n-1)/3\) then \(G\) contains a subgraph that can be obtained from a hamiltonian path by adding all edges joining vertices of distance two on the path.
0 references
minimum degree
0 references
hamiltonian path
0 references
0.8687098622322083
0 references
0.8242409825325012
0 references
0.8197714686393738
0 references
0.8177207112312317
0 references
