Every 3‐connected claw‐free <i>Z</i> <sub>8</sub> ‐free graph is Hamiltonian (Q3055900): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A reduction method to find spanning Eulerian subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Claw-free 3-connectedP11-free graphs are hamiltonian / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a closure concept in claw-free graphs / rank | |||
Normal rank | |||
Latest revision as of 11:38, 3 July 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
