9-connected claw-free graphs are Hamilton-connected (Q1305527): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Not every 2-tough graph is Hamiltonian / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A method in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on \(K_ 4\)-closures in hamiltonian graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Closure concepts for claw-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3872508 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian results inK1,3-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a closure concept in claw-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4869540 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On hamiltonian line graphs and connectivity / rank | |||
Normal rank | |||
Latest revision as of 09:27, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 9-connected claw-free graphs are Hamilton-connected |
scientific article |
Statements
9-connected claw-free graphs are Hamilton-connected (English)
0 references
27 February 2000
0 references
A graph \(G\) is claw-free if no induced subgraph of \(G\) is isomorphic to \(K_{1,3}\). Further, a graph is Hamilton-connected if any pair of its vertices is joined by a Hamiltonian path. The author shows that every 9-connected claw-free graph is Hamilton-connected.
0 references
Hamilton-connected
0 references
claw-free
0 references
