Hamiltonian square-paths (Q1924142): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian square-paths |
scientific article |
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
