专家学者_浙江师范大学机构库首页
学者简介
朱绪鼎
职务/职称: 正高级/教授
二级机构: 数学与计算机科学学院
学科领域:
SCIE : 94
EI : 40
SCIE : 94
EI : 40
ISTP : 5
北大核心 : 1
CSCD : 1
成果总量: 155
合作学者 更多
公开发表的成果 138
教学成果 17
成果类型
期刊 112
会议论文 9
科研项目 8
学位论文 17
科技成果 5
会议论文集 4
成果收录
SCIE科学引文索引(美) 94
EI工程索引(美) 40
CPCI(ISTP)科技会议录索引(美) 5
中文核心期刊(北大) 1
CSCD中国科学引文库(中科院) 1
作者类型
第一作者 8
通讯作者 40
其他 111
语种
中文 37
外文 118
教育部学科
理学 101
数学 101
工学 13
计算机科学与技术 11
软件工程 2
信息与通信工程 1
经济学 1
应用经济学 1
JCR分区
Q1 3
Q2 16
Q3 70
Q4 28
中科院分区
  • 大类
  • 小类
3 31
4 51
关键词
planar graph 7
combinatorial nullstellensatz 7
list colouring 5
choice number 5
chromatic number 5
matrix 4
circular chromatic number 4
平面图 4
kneser graphs 4
permanent 4
girth 4
fractional arboricity 3
在线列表染色 3
signed graph 3
列表染色 3
list coloring 3
planar graphs 3
3
on-line list colouring 3
total weight choosability 3
年份
2021 7
2020 18
2019 12
2018 16
2017 17
2016 13
2015 14
2014 14
2013 13
2012 10
2011 17
2010 1
全文获取
全文附件 1
挂接全文 69
OA资源 110
其他 22
文献传递 56
排序:
本页全选
返回 155 结果
作者
Grytczuk, J (Grytczuk, Jaroslaw)1,2Przybylo, J (Przybylo, Jakub)3Zhu, XD (Zhu, Xuding)4Grytczuk, J (Grytczuk, Jaroslaw)1,2Przybylo, J (Przybylo, Jakub)3Zhu, XD (Zhu, Xuding)4
出处
Random Structures and Algorithms 2011 Vol.38 No.1-2 P162-173 10429832
关键词
List coloring;Local lemma;Thue sequences
摘要
A vertex colouring c of a graph G is called nonrepetitive if for every integer r ≥ 1 and every path P vsub1subvsub2subvsub2rsub in G the first half o...
收录
SCIE
作者
Lin, CY (Lin, Cheyu)1Zhu, XD (Zhu, Xuding)2
出处
Discrete Mathematics 2016 Vol.339 No.2 P857-865 0012365X
关键词
Circular chromatic number;Monochromatic network;Total graph
摘要
The circular total chromatic number of a graph G written χc″G is the infimum r permitting a function cVG∪EG→[0r such that 1≤cxcx′≤r1 whenever x and x″...
收录
SCIE
作者
Fiorenzi, F (Fiorenzi, Francesca)2Ochem, P (Ochem, Pascal)2Ossona de Mendez, P (Ossona de Mendez, Patrice)3Zhu, XD (Zhu, Xuding)1
出处
Discrete Applied Mathematics 2011 Vol.159 No.17 P2045-2049 0166218X
关键词
Non-repetitive colouring;Thue choosability;Thue chromatic number;Thue sequence;Tree
摘要
A vertex colouring of a graph G is nonrepetitive if for any path P supv1supsupv2sup⋯v2subrsub in G the first half is coloured differently from the sec...
收录
SCIE
EI
作者
Kierstead, HA (Kierstead, H. A.)1Yang, CY (Yang, Chung-Ying)2Yang, DQ (Yang, Daqing)3Zhu, XD (Zhu, Xuding)4
出处
European Journal of Combinatorics 2012 Vol.33 No.4 P435-445 01956698
摘要
We prove that the maximum adapted game chromatic number of trees is 3 the maximum adapted game chromatic number of outerplanar graphs is 5 the adapted...
收录
SCIE
作者
Mahoney, T (Mahoney, Thomas)1Meng, JX (Meng, Jixian)2Zhu, XD (Zhu, Xuding)2
出处
Electronic Journal of Combinatorics 2015 Vol.22 No.2 10778926
摘要
In this paper we prove that for any graph G and any positive integer m G is 2m mpaintable if and only if G is 2paintable It was asked by Zhu in 2009 w...
收录
SCIE
作者
Liu, DDF (Liu, Daphne Der-Fen)1Zhu, XD (Zhu, Xuding)2
出处
Journal of Combinatorial Optimization 2016 Vol.32 No.3 P765-774 13826905
关键词
Chromatic number;Circular chromatic number;Kneser graphs
摘要
Chen J Combin Theory A 11831062–1071 2011 confirmed the Johnson–Holroyd–Stahl conjecture that the circular chromatic number of a Kneser graph is equal...
收录
SCIE
EI
作者
Wong, TL (Wong, Tsai-Lien)1Zhu, XD (Zhu, Xuding)2
出处
Journal of Graph Theory 2012 Vol.70 No.3 P348-359 03649024
关键词
antimagic labelling;combinatorial nullstellensatz;vertex weighted graph
摘要
We say G is kantimagic if there is an injection f E→1 2 ⋯ E k such that for any two distinct vertices u and v We say G is weightedkantimagic if for a...
收录
SCIE
EI
作者
Kim, SJ (Kim, Seog-Jin)1Kwon, YS (Kwon, Young Soo)2Liu, DDF (Liu, Daphne Der-Fen)3Zhu, XD (Zhu, Xuding)4
出处
Electronic Journal of Combinatorics 2012 Vol.19 P1-13 10778926
摘要
The Ohba Conjecture says that every graph G with pipeV Gpipe ≤ 2χG 1 is chromatic choosable This paper studies an online version of Ohba Conjecture W...
收录
SCIE
作者
Chang, GJ (Chang, Gerard Jennhwa)1,2,3Liu, DDF (Liu, Daphne Der-Fen)4Zhu, XD (Zhu, Xuding)5
出处
Journal of Combinatorial Theory. Series A 2013 Vol.120 No.1 P159-163 00973165
关键词
Chromatic number;Circular chromatic number;Kneser graphs
摘要
We give a short proof for Chens Alternative Kneser Coloring Lemma This leads to a short proof for the JohnsonHolroydStahl conjecture that Kneser graph...
收录
SCIE
作者
Meng, JX (Meng, Jixian)1Puleo, GJ (Puleo, Gregory J.)2Zhu, XD (Zhu, Xuding)1
出处
Journal of Graph Theory 2017 Vol.85 No.2 P412-428 03649024
关键词
(4:2)-choosable graphs;3-choosable critical graphs;list colouring
摘要
An a 1choosable graph is also called achoosable In the pioneering article on list coloring of graphs by Erdős et al 2choosable graphs are characterize...
收录
SCIE
EI
专家学者_浙江师范大学机构库首页 列表公用js