On the largest reduced neighborhood clique cover number of a graph (Q2971258)
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: On the largest reduced neighborhood clique cover number of a graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the largest reduced neighborhood clique cover number of a graph |
scientific article |
Statements
4 April 2017
0 references
\(t\)-shallow minors
0 references
polynomial bounded neighborhood clique
0 references
math.CO
0 references
