Name
Abstract | ||
|---|---|---|
We classify the trees on n vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and Radcliffe on the maximum and minimum number of existence homomorphisms from a tree to a completely looped graph on q vertices. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.disc.2018.12.015 | Discrete Mathematics |
Keywords | Field | DocType |
Vertex coloring,Extremal enumeration,Tree,Conflict-free coloring | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Homomorphism,Rainbow,Mathematics | Journal |
Volume | Issue | ISSN |
342 | 4 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Engbers | 1 | 21 | 6.79 |
| Christopher J. Stocker | 2 | 2 | 0.93 |