共 50 条
Maximizing and minimizing the number of generalized colorings of trees
被引:0
|作者:
Engbers, John
[1
]
Stocker, Christopher
[1
]
机构:
[1] Marquette Univ, Dept Math Stat & Comp Sci, Milwaukee, WI 53201 USA
关键词:
Vertex coloring;
Extremal enumeration;
Tree;
Conflict-free coloring;
UNIQUE-MAXIMUM;
SETS;
D O I:
10.1016/j.disc.2018.12.015
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
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. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:1048 / 1055
页数:8
相关论文