Maximizing and minimizing the number of generalized colorings of trees (Q1727776)
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: Maximizing and minimizing the number of generalized colorings of trees |
scientific article; zbMATH DE number 7027163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing and minimizing the number of generalized colorings of trees |
scientific article; zbMATH DE number 7027163 |
Statements
Maximizing and minimizing the number of generalized colorings of trees (English)
0 references
20 February 2019
0 references
vertex coloring
0 references
extremal enumeration
0 references
tree
0 references
conflict-free coloring
0 references
0 references
0.8134893774986267
0 references
0.8009255528450012
0 references
0.7643361687660217
0 references
0.7623178362846375
0 references
0.7621178030967712
0 references
