Every 3‐connected claw‐free <i>Z</i> <sub>8</sub> ‐free graph is Hamiltonian (Q3055900): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:46, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 3‐connected claw‐free <i>Z</i> <sub>8</sub> ‐free graph is Hamiltonian |
scientific article |
Statements
Every 3‐connected claw‐free <i>Z</i> <sub>8</sub> ‐free graph is Hamiltonian (English)
0 references
10 November 2010
0 references
Hamiltonian graphs
0 references
forbidden subgraphs
0 references
claw-free graphs
0 references
supereulerian graphs
0 references
