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 条
  • [21] Minimizing phylogenetic number to find good evolutionary trees
    Goldberg, LA
    Goldberg, PW
    Phillips, CA
    Sweedyk, E
    Warnow, T
    DISCRETE APPLIED MATHEMATICS, 1996, 71 (1-3) : 111 - 136
  • [22] On the Crossing Number of Generalized Fat Trees
    Rajan, Bharati
    Rajasingh, Indra
    Beulah, P. Vasanthi
    INFORMATICS ENGINEERING AND INFORMATION SCIENCE, PT III, 2011, 253 : 440 - +
  • [23] Maximizing Subject Follow-Up by Minimizing the Number of Cooks in the Kitchen
    Sosa, Lenis
    Martinez, Rebecca E.
    Shen, Loren
    Harun, Nusrat
    Sline, Rick
    Sangha, Navdeep
    Wu, Tzu-Ching
    Indupuru, Hari
    Misra, Vivek
    Sarraj, Amrou
    Alderman, Susan
    Hess, Mary Jane
    Fontenot, Tonita
    El Khoury, Ramy
    Kasam, Mallikarjunarao
    Hicks, William
    Sahota, Preeti
    Barretto, Andrew
    Grotta, James
    Savitz, Sean
    Lopez, George
    Gonzales, Nicole
    STROKE, 2011, 42 (03) : E238 - E239
  • [24] RECONSTRUCTION FOR COLORINGS ON TREES
    Bhatnagar, Nayantara
    Vera, Juan
    Vigoda, Eric
    Weitz, Dror
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (02) : 809 - 826
  • [25] Trees with Given Diameter Minimizing the Augmented Zagreb Index and Maximizing the ABC Index
    Huang Yu-fei
    Communications in Mathematical Research, 2017, 33 (01) : 8 - 18
  • [26] ON THE DOMINATOR COLORINGS IN TREES
    Merouane, Houcine Boumediene
    Chellali, Mustapha
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2012, 32 (04) : 677 - 683
  • [27] On Hamiltonian Colorings of Trees
    Bantva, Devsi
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2016, 2016, 9602 : 49 - 60
  • [28] Nonrepetitive colorings of trees
    Bresar, B.
    Grytczuk, J.
    Klavzar, S.
    Niwczyk, S.
    Peterin, I.
    DISCRETE MATHEMATICS, 2007, 307 (02) : 163 - 172
  • [29] Maximizing the number of independent subsets over trees with bounded degree
    Heuberger, Clemens
    Wagner, Stephan G.
    JOURNAL OF GRAPH THEORY, 2008, 58 (01) : 49 - 68
  • [30] Trees with Given Independence Number Maximizing the Aa-Spectral
    School of Mathematics and Statistics, Qinghai Normal University, Xining, China
    不详
    不详
    Int. Workshop Comput. Sci. Eng., WCSE, 1600, (248-252): : 248 - 252
12345