中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

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

条数/页: 排序方式:
Neighbor sum distinguishing total choosability of planar graphs 期刊论文  OAI收割
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 卷号: 32, 期号: 3, 页码: 906-916
作者:  
Qu, Cunquan;  Wang, Guanghui;  Yan, Guiying;  Yu, Xiaowei
  |  收藏  |  浏览/下载:25/0  |  提交时间:2018/07/30
Neighbor Distinguishing Total Choice Number of Sparse Graphs via the Combinatorial Nullstellensatz 期刊论文  OAI收割
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2016, 卷号: 32, 期号: 2, 页码: 537-548
作者:  
Qu, Cun-quan;  Ding, Lai-hao;  Wang, Guang-hui;  Yan, Gui-ying
  |  收藏  |  浏览/下载:24/0  |  提交时间:2018/07/30
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable 期刊论文  OAI收割
ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2014, 卷号: 30, 期号: 6, 页码: 993-1006
作者:  
Cai Jian Sheng;  Teng Chang Chun;  Yan Gui Ying
  |  收藏  |  浏览/下载:16/0  |  提交时间:2021/01/14
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable 期刊论文  OAI收割
Science China Mathematics,, 2012, 卷号: 55, 期号: 12, 页码: 2601-2612
作者:  
Cai JianSheng;  Wang GuangHui;  Yan GuiYing
  |  收藏  |  浏览/下载:12/0  |  提交时间:2021/01/14
Equitable Total Coloring of F-n boolean OR Wn 期刊论文  OAI收割
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2009, 卷号: 25, 期号: 1, 页码: 83-86
作者:  
Gong, Kun;  Zhang, Zhong-fu;  Wang, Jian-fang
  |  收藏  |  浏览/下载:15/0  |  提交时间:2018/07/30
On adjacent-vertex-distinguishing total coloring of graphs 期刊论文  OAI收割
SCIENCE IN CHINA SERIES A-MATHEMATICS, 2005, 卷号: 48, 期号: 3, 页码: 289-299
作者:  
Zhang, ZF;  Chen, XE;  Li, JW;  Yao, B;  Lu, XZ
  |  收藏  |  浏览/下载:14/0  |  提交时间:2018/07/30