Some bounds on the generalised total chromatic number of degenerate graphs

被引：0
|
作者：
Broere, Izak [1 ]
Semanisin, Gabriel [2 ]
机构：
[1] Univ Pretoria, Dept Math & Appl Math, Pretoria, South Africa
[2] Safarik Univ, Fac Sci, Inst Comp Sci, Kosice, Slovakia
来源：
INFORMATION PROCESSING LETTERS | 2017年 / 122卷
基金：
新加坡国家研究基金会;
关键词：
Combinatorial problems; Total colouring number; Graph property; k-Degenerate graph; MINIMAL REDUCIBLE BOUNDS;
D O I：
10.1016/j.ipl.2017.02.008
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The total generalised colourings considered in this paper are colourings of the vertices and of the edges of graphs satisfying the following conditions: each set of vertices of the graph which receive the same colour induces an m-degenerate graph, each set of edges of the graph which receive the same colour induces an n-degenerate graph, and incident elements receive different colours. Bounds for the least number of colours with which this can be done for all k-degenerate graphs are obtained. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：30 / 33
页数：4
相关论文
共 50 条
  • [41] Bar κ-visibility graphs:: Bounds on the number of edges, chromatic number, and thickness
    Dean, AM
    Evans, W
    Gethner, E
    Laison, JD
    Safari, MA
    Trotter, WT
    [J]. GRAPH DRAWING, 2006, 3843 : 73 - 82
  • [42] Some upper bounds for the total-rainbow connection number of graphs
    Liu, Sujuan
    Zhao, Yan
    Wang, Linlin
    [J]. ARS COMBINATORIA, 2020, 150 : 159 - 169
  • [43] Total dominator chromatic number of Kneser graphs
    Jalilolghadr, Parvin
    Behtoei, Ali
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2023, 20 (01) : 52 - 56
  • [44] Total dominator chromatic number of Mycieleskian graphs
    Kazemi, Adel P.
    [J]. UTILITAS MATHEMATICA, 2017, 103 : 129 - 137
  • [45] On the double total dominator chromatic number of graphs
    Beggas, Fairouz
    Kheddouci, Hamamache
    Marweni, Walid
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2022, 14 (05)
  • [46] Total chromatic number of generalized Mycielski graphs
    Chen, Meirun
    Guo, Xiaofeng
    Li, Hao
    Zhang, Lianzhu
    [J]. DISCRETE MATHEMATICS, 2014, 334 : 48 - 51
  • [47] On total chromatic number of direct product graphs
    Prnaver K.
    Zmazek B.
    [J]. Journal of Applied Mathematics and Computing, 2010, 33 (1-2) : 449 - 457
  • [48] Results about the total chromatic number and the conformability of some families of circulant graphs
    Faria, Luerbio
    Nigro, Mauro
    Preissmann, Myriam
    Sasaki, Diana
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 340 : 123 - 133
  • [49] Total Dominator Edge Chromatic Number of Graphs
    Li, Minhui
    Zhang, Shumin
    Wang, Caiyun
    Ye, Chengfu
    [J]. IAENG International Journal of Applied Mathematics, 2021, 51 (04) : 1 - 6
  • [50] TOTAL CHROMATIC NUMBER OF GRAPHS OF HIGH DEGREE
    叶宏博
    王建芳
    张忠辅
    [J]. Science Bulletin, 1990, (17) : 1492 - 1492
12345