Hamiltonicity and minimum degree in 3-connected claw-free graphs (Q1850548): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.2001.2039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992542849 / 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: A nine point theorem for 3-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: When m vertices in a k-connected graph cannot be walked round along a simple cycle / 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 | |||
Revision as of 18:10, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonicity and minimum degree in 3-connected claw-free graphs |
scientific article |
Statements
Hamiltonicity and minimum degree in 3-connected claw-free graphs (English)
0 references
10 December 2002
0 references
claw
0 references
Hamiltonian
0 references
