CORC

浏览/检索结果: 共6条,第1-6条 帮助

限定条件    
已选(0)清除 条数/页:   排序方式:
Minimum degree condition for a graph to be knitted 期刊论文
DISCRETE MATHEMATICS, 2019, 卷号: 342, 期号: 11, 页码: 3225-3228
作者:  Liu, Runrun;  Rolek, Martin;  Yu, Gexin*
收藏  |  浏览/下载:10/0  |  提交时间:2019/12/23
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from { 6 , 7 , 8 } 期刊论文
Graphs and Combinatorics, 2019, 卷号: 35, 期号: 3, 页码: 695-705
作者:  Liu, Runrun;  Loeb, Sarah;  Rolek, Martin;  Yin, Yuxue;  Yu, Gexin*
收藏  |  浏览/下载:4/0  |  提交时间:2019/12/23
DP-4-colorability of two classes of planar graphs 期刊论文
DISCRETE MATHEMATICS, 2019, 卷号: 342, 期号: 11, 页码: 2984-2993
作者:  Chen, Lily;  Liu, Runrun*;  Yu, Gexin;  Zhao, Ren;  Zhou, Xiangqian
收藏  |  浏览/下载:4/0  |  提交时间:2019/12/23
Strong edge-coloring for planar graphs with large girth 期刊论文
DISCRETE MATHEMATICS, 2019, 卷号: 342, 期号: 2, 页码: 339-343
作者:  Chen, Lily;  Deng, Kecai;  Yu, Gexin;  Zhou, Xiangqian*
收藏  |  浏览/下载:8/0  |  提交时间:2019/12/23
DP-3-coloring of some planar graphs 期刊论文
Discrete Mathematics, 2019, 卷号: 342, 期号: 1, 页码: 178-189
作者:  Liu, Runrun;  Loeb, Sarah;  Yin, Yuxue;  Yu, Gexin*
收藏  |  浏览/下载:7/0  |  提交时间:2019/12/23
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable 期刊论文
DISCRETE MATHEMATICS, 2019, 卷号: 342, 期号: 8, 页码: 2333-2341
作者:  Yin, Yuxue;  Yu, Gexin*
收藏  |  浏览/下载:7/0  |  提交时间:2019/12/23


©版权所有 ©2017 CSpace - Powered by CSpace