Claw-free and \(N(2,1,0)\)-free graphs are almost net-free (Q897278): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00373-014-1506-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-014-1506-1 / rank | |||
Normal rank | |||
Latest revision as of 07:39, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Claw-free and \(N(2,1,0)\)-free graphs are almost net-free |
scientific article |
Statements
Claw-free and \(N(2,1,0)\)-free graphs are almost net-free (English)
0 references
17 December 2015
0 references
forbidden subgraph
0 references
claw-free graph
0 references
Hamiltonian cycle
0 references
