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
来源：
DISCRETE MATHEMATICS | 2019年 / 342卷 / 04期
关键词：
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
相关论文
共 50 条
  • [31] Minimizing the Laplacian spectral radius of trees with given matching number
    Feng, Lihua
    Li, Qiao
    Zhang, Xiao-Dong
    LINEAR & MULTILINEAR ALGEBRA, 2007, 55 (02): : 199 - 207
  • [32] Minimizing number of wavelengths in multicast routing trees in WDM networks
    Li, DY
    Du, XF
    Hu, XD
    Lu, R
    Jia, XH
    NETWORKS, 2000, 35 (04) : 260 - 265
  • [33] Detecting Differentially Expressed Genes: Minimizing Burden of Testing and Maximizing Number of Discoveries
    Lee, Wen-Chung
    ANNALS OF EPIDEMIOLOGY, 2010, 20 (10) : 766 - 771
  • [34] On Counting Generalized Colorings
    Kotek, T.
    Makowsky, J. A.
    Zilber, B.
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2008, 5213 : 339 - +
  • [35] Trees in greedy colorings of hypergraphs
    Gyarfas, Andras
    Lehel, Jeno
    DISCRETE MATHEMATICS, 2011, 311 (2-3) : 208 - 209
  • [36] Hyperbolic Tessellation and Colorings of Trees
    Kim, Dong Han
    Lim, Seonhee
    ABSTRACT AND APPLIED ANALYSIS, 2013,
  • [37] Acyclic colorings of products of trees
    Jamison, Robert E.
    Matthews, Gretchen L.
    Villalpando, John
    INFORMATION PROCESSING LETTERS, 2006, 99 (01) : 7 - 12
  • [38] ON GENERALIZED GRAPH COLORINGS
    BROWN, JI
    CORNEIL, DG
    JOURNAL OF GRAPH THEORY, 1987, 11 (01) : 87 - 99
  • [39] Maximizing the number of spanning trees in Kn-complements of asteroidal graphs
    Nikolopoulos, Stavros D.
    Palios, Leonidas
    Papadopoulos, Charis
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3049 - 3060
  • [40] Generalized colorings of graphs
    Xu, Honghai
    ProQuest Dissertations and Theses Global, 2016,
12345