The total coloring of K5-minor-free graphs

被引：0
|
作者：
Yang, Fan [1 ]
Wu, Jianliang [1 ]
机构：
[1] School of Mathematics, Shandong University, Jinan,250100, China
来源：
arXiv | 2021年
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Free graphs - Graph G - K-coloring - Total chromatic number - Total coloring
引用
收藏
相关论文
共 50 条
  • [1] The total coloring of K5-minor-free graphs
    Yang, Fan
    Wu, Jianliang
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 102
  • [2] Choosability of K5-minor-free graphs
    Skrekovski, R
    DISCRETE MATHEMATICS, 1998, 190 (1-3) : 223 - 226
  • [3] (k, d)*-Choosability of K5-Minor-Free Graphs
    Miao, Wenjing
    INFORMATION COMPUTING AND APPLICATIONS, PT 2, 2012, 308 : 328 - 333
  • [4] List-coloring clique-hypergraphs of K5-minor-free graphs strongly
    Liang, Zuosong
    Wu, Jianliang
    Shan, Erfang
    DISCRETE MATHEMATICS, 2020, 343 (04)
  • [5] Another proof of the 5-choosability of K5-minor-free graphs
    He, Wenjie
    Miao, Wenjing
    Shen, Yufa
    DISCRETE MATHEMATICS, 2008, 308 (17) : 4024 - 4026
  • [6] The Alon-Tarsi number of K5-minor-free graphs
    Abe, Toshiki
    Kim, Seog-Jin
    Ozeki, Kenta
    DISCRETE MATHEMATICS, 2022, 345 (04)
  • [7] List Colorings of K5-Minor-Free Graphs With Special List Assignments
    Cranston, Daniel W.
    Pruchnewski, Anja
    Tuza, Zsolt
    Voigt, Margit
    JOURNAL OF GRAPH THEORY, 2012, 71 (01) : 18 - 30
  • [8] On the vertex-arboricity of K5-minor-free graphs of diameter 2
    Huang, Fei
    Wang, Xiumei
    Yuan, Jinjiang
    DISCRETE MATHEMATICS, 2014, 322 : 1 - 4
  • [9] COLORING ALGORITHMS FOR K5-MINOR FREE GRAPHS
    KHULLER, S
    INFORMATION PROCESSING LETTERS, 1990, 34 (04) : 203 - 208
  • [10] Exponential speedup of fixed-parameter algorithms on K3,3-minor-free or K5-minor-free graphs
    Demaine, ED
    Hajiaghayi, MT
    Thilikos, DA
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 262 - 273
12345