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 条
  • [1] Maximizing the number of q-colorings
    Loh, Po-Shen
    Pikhurko, Oleg
    Sudakov, Benny
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2010, 101 : 655 - 696
  • [2] Flexible list colorings: Maximizing the number of requests satisfied
    Kaul, Hemanshu
    Mathew, Rogers
    Mudrock, Jeffrey A.
    Pelsmajer, Michael J.
    JOURNAL OF GRAPH THEORY, 2024, 106 (04) : 887 - 906
  • [3] Minimizing the number of holes in 2-distant colorings
    Troxell, DS
    ARS COMBINATORIA, 1995, 41 : 77 - 86
  • [4] Maximizing the number of x-colorings of 4-chromatic graphs
    Erey, Aysel
    DISCRETE MATHEMATICS, 2018, 341 (05) : 1419 - 1431
  • [5] Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree
    John Engbers
    Graphs and Combinatorics, 2024, 40 (6)
  • [6] Maximizing the Number of Spanning Trees in a Connected Graph
    Li, Huan
    Patterson, Stacy
    Yi, Yuhao
    Zhang, Zhongzhi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (02) : 1248 - 1260
  • [7] Maximizing the Index of Trees with Given Domination Number
    Guo, Guangquan
    Wang, Guoping
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 2014, 57 (03): : 520 - 525
  • [8] Optimal on-line colorings for minimizing the number of ADMs in optical networks
    Shalom, Mordechai
    Wong, Prudence W. H.
    Zaks, Shmuel
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, 4731 : 435 - +
  • [9] Optimal on-line colorings for minimizing the number of ADMs in optical networks
    Shalom, Mordechai
    Wong, Prudence W. H.
    Zaks, Shmuel
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (02) : 174 - 188
  • [10] Optimal on-line colorings for minimizing the number of ADMs in optical networks
    Shalom, Mordechai
    Wong, Prudence W. H.
    Zaks, Shmuel
    ICTON 2007: PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS, VOL 1, 2007, : 58 - 58
12345