The K-(2,1)-Total Choosability of 1-Planar Graphs without Adjacent Short Cycles

被引：0

作者：

Song, Yan ^{[1
]}

Sun, Lei ^{[1
]}

机构：

[1] Shandong Normal University, Shandong, Jinan,250014, China

来源：

IAENG International Journal of Applied Mathematics | 2022年 / 52卷 / 02期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[11] Acyclic 6-choosability of planar graphs without adjacent short cycles
WeiFan Wang
Ge Zhang
Min Chen
Science China Mathematics, 2014, 57 : 197 - 209
[12] Acyclic 4-choosability of planar graphs without adjacent short cycles
Borodin, Oleg V.
Ivanova, Anna O.
DISCRETE MATHEMATICS, 2012, 312 (22) : 3335 - 3341
[13] Acyclic 6-choosability of planar graphs without adjacent short cycles
Wang WeiFan
Zhang Ge
Chen Min
SCIENCE CHINA-MATHEMATICS, 2014, 57 (01) : 197 - 209
[14] Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles
Borodin, O. V.
Ivanova, A. O.
JOURNAL OF GRAPH THEORY, 2011, 68 (02) : 169 - 176
[15] Fractional coloring problem of 1-planar graphs without short cycles
Li, Meng Jiao
Sun, Lei
Zheng, Wei
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (08)
[16] On (2, r)-choosability of planar graphs without short cycles
Hou, Jianfeng
Zhu, Hongguo
APPLIED MATHEMATICS AND COMPUTATION, 2023, 444
[17] (Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles
Chang, Gerard J.
Roussel, Nicolas
DISCRETE MATHEMATICS, 2012, 312 (14) : 2126 - 2130
[18] Edge choosability of planar graphs without short cycles
Wang, WF
SCIENCE IN CHINA SERIES A-MATHEMATICS, 2005, 48 (11): : 1531 - 1544
[19] Edge choosability of planar graphs without short cycles
WANG Weifan School of Mathematics and Physics
Science China Mathematics, 2005, (11) : 1531 - 1544
[20] Edge choosability of planar graphs without short cycles
WANG Weifan School of Mathematics and Physics Zhejiang Normal University Jinhua China
ScienceinChina,SerA., 2005, Ser.A.2005 (11) : 1531 - 1544

← 1 2 3 4 5 →