Claw-free and \(N(2,1,0)\)-free graphs are almost net-free (Q897278)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Claw-free and \(N(2,1,0)\)-free graphs are almost net-free |
scientific article; zbMATH DE number 6521773
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Claw-free and \(N(2,1,0)\)-free graphs are almost net-free |
scientific article; zbMATH DE number 6521773 |
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
