Claw-free and \(N(2,1,0)\)-free graphs are almost net-free (Q897278): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Hamiltonicity in claw-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3577833 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3918148 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizing forbidden pairs for hamiltonian properties / rank | |||
Normal rank | |||
Revision as of 04:50, 11 July 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
