Finding a smallest odd hole in a claw-free graph using global structure (Q2444540)
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: Finding a smallest odd hole in a claw-free graph using global structure |
scientific article; zbMATH DE number 6282264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a smallest odd hole in a claw-free graph using global structure |
scientific article; zbMATH DE number 6282264 |
Statements
Finding a smallest odd hole in a claw-free graph using global structure (English)
0 references
10 April 2014
0 references
odd hole
0 references
claw-free graph
0 references
0 references
0.9287081
0 references
0.88777745
0 references
0 references
0 references
0 references
0.8527083
0 references
0.84842074
0 references
0.8465074
0 references
0.8459015
0 references
