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 条
  • [1] Some bounds on the injective chromatic number of graphs
    Doyon, Alain
    Hahn, Gena
    Raspaud, Andre
    [J]. DISCRETE MATHEMATICS, 2010, 310 (03) : 585 - 590
  • [2] THE TOTAL CHROMATIC NUMBER OF SOME GRAPHS
    张忠辅
    张建勋
    王建方
    [J]. Science in China,Ser.A., 1988, Ser.A.1988 (12) - 1441
  • [3] THE TOTAL CHROMATIC NUMBER OF SOME GRAPHS
    ZHANG, ZF
    ZHANG, JX
    WANG, JF
    [J]. SCIENTIA SINICA SERIES A-MATHEMATICAL PHYSICAL ASTRONOMICAL & TECHNICAL SCIENCES, 1988, 31 (12): : 1434 - 1441
  • [4] THE TOTAL CHROMATIC NUMBER OF SOME GRAPHS
    张忠辅
    张建勋
    王建方
    [J]. Science China Mathematics, 1988, (12) : 1434 - 1441
  • [5] The total chromatic number of some bipartite graphs
    Campos, C. N.
    de Mello, C. P.
    [J]. ARS COMBINATORIA, 2008, 88 : 335 - 347
  • [6] Bounds for the b-chromatic number of some families of graphs
    Kouider, M
    Zaker, M
    [J]. DISCRETE MATHEMATICS, 2006, 306 (07) : 617 - 623
  • [7] Total chromatic number for some classes of Cayley graphs
    S. Prajnanaswaroopa
    J. Geetha
    K. Somasundaram
    [J]. Soft Computing, 2023, 27 : 15609 - 15617
  • [8] Total chromatic number for some classes of Cayley graphs
    Prajnanaswaroopa, S.
    Geetha, J.
    Somasundaram, K.
    [J]. SOFT COMPUTING, 2023, 27 (21) : 15609 - 15617
  • [9] Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
    [J]. Hu, Xiaolan (xlhu@mail.ccnu.edu.cn), 2017, Elsevier B.V., Netherlands (233)
  • [10] Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
    Hu, Xiaolan
    Zhang, Yunqing
    Miao, Zhengke
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 233 : 29 - 32
12345