Claw-free 3-connectedP11-free graphs are hamiltonian (Q3159394): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/jgt.20019 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031237233 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4398864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:09, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Claw-free 3-connectedP11-free graphs are hamiltonian |
scientific article |
Statements
Claw-free 3-connectedP11-free graphs are hamiltonian (English)
0 references
16 February 2005
0 references
Hamilton cycle
0 references
claw-free graphs
0 references
forbidden subgraphs
0 references