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年

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Free graphs - Graph G - K-coloring - Total chromatic number - Total coloring

引用

共 14 条

[1] Coloring (P5,gem-free graphs with Δ−1 colors
Cranston, Daniel W.
Lafayette, Hudson
Rabern, Landon
Journal of Graph Theory, 2022, 101 (04): : 633 - 642
[2] New Results on Edge-Coloring and Total-Coloring of Split Graphs
da Costa, Diego Amaro Ferraz
Couto, Fernanda
Klein, Sulamita
SSRN,
[3] Maximum spread of K2,t-minor-free graphs
Linz, William
Lu, Linyuan
Wang, Zhiyu
arXiv, 2022,
[4] Coloring Triangle-Free Graphs and Network Games
University of California, San Diego
[5] Adjacent Vertex Distinguishing Total Coloring of Corona Product of Graphs
Furmańczyk, Hanna
Zuazua, Rita
arXiv, 2022,
[6] Incidence adjacent vertex-distinguishing total coloring of graphs
Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China
不详
Proc. - Int. Conf. Comput. Intell. Softw. Eng., CiSE, 1600,
[7] Adjacent vertex distinguishing total coloring of Cartesian product graphs
Course Department, Common Course Department, Anhui Xinhua University, Hefei, China
Future Mechatronics Automation Proc. Intl. Conf. Future. Mechatronics Automation, (191-194):
[8] Adjacent Vertex Reducible Total Coloring Algorithm for Several Joint Graphs
Yang, Wenzhu
Li, Jingwen
ITOEC 2023 - IEEE 7th Information Technology and Mechatronics Engineering Conference, 2023, : 620 - 624
[9] Neighbor sum distinguishing total coloring of sparse IC-planar graphs
Song, Wen-yao
Miao, Lian-ying
Li, Jin-bo
Zhao, Yue-ying
Pang, Jing-ru
Discrete Applied Mathematics, 2019, 239 : 183 - 192
[10] Structure and coloring of some (P7, C4)-free graphs
Institute of Mathematics, School of Mathematical Sciences, Nanjing Normal University, 1 Wenyuan Road, Nanjing
210023, China
arXiv,

← 1 2 →