On cliques and forcing \(m\)-convexity numbers of graphs. (Q4897489)
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 cliques and forcing m-convexity numbers of graphs. |
scientific article; zbMATH DE number 6116799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On cliques and forcing \(m\)-convexity numbers of graphs. |
scientific article; zbMATH DE number 6116799 |
Statements
19 December 2012
0 references
graph
0 references
\(m\)-convex set
0 references
\(m\)-forcing subset
0 references
\(m\)-forcing convexity number
0 references
forcing \(c\)-subset
0 references
forcing clique number
0 references
0.8327211141586304
0 references
0.8317055702209473
0 references
0.8231405019760132
0 references
0.7734326720237732
0 references
