维普期刊资源整合服务平台（V6.5）

55篇 您的检索式：作者名="RASPAUD A"

选中清除导出查看参考文献查看引证文献引用追踪共3页首页上一页第1页下一页末页 /3 跳转

	题名	作者	年代	出处	被引量
1	Linear choosability of graphs显示文摘	Esperet L Montassier M Raspaud A	2008	Discrete Math2008，308，17：	1
2	Linear coloring of planar graphs with large girth显示文摘	Raspaud A Wang W	2009	Discrete Math2009，309，18：	1
3	Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable 显示文摘	BORODIN O V GLEBOV A N RASPAUD A	2005	Discrete Math2005，93，2：	1
4	Upper bounds on the linear chromatic number of a graph显示文摘	Li Chao Wang Weifan Raspaud A	2011	Discrete Math2011，311，4：	1
5	Postman tours and cycle covers 显示文摘	Raspaud A	1993	Discrete Mathematics1993，111，13：	1
6	L(p, q)-labeling of sparse graphs 显示文摘	CHARPENTIER C MONTASSIER M RASPAUD A	2013	Journal of Combinatorial Opti- mization2013，25，4：	1
7	Linear coloring of planar graphs with large girth 显示文摘	Raspaud A Wang Weifan	2009	Discrete Math2009，309，18：	1
8	Star coloring of graphs显示文摘	FERTIN G RASPAUD A REED B	2004	Journal of Graph Theory2004，47，3：	1
9	Upper bounds on the linear chromatic number of graph 显示文摘	Li Chao Wang Weifan Raspaud A	2011	Discrete Math2011，311，4：	1
10	Star coloring of graphs显示文摘	FERTIN G RASPAUD A REED B	2004	Journal of Graph Theory2004，47，3：	1
11	Star coloring of graphs显示文摘	Fertin G Raspaud A Reed B	2004	Journal of Graph Theory2004，47，3：	1
12	Star Coloring of Graphs 显示文摘	Fertin G Raspaud A Reed B	2004	Journal of Graph Theory2004，47，3：	1
13	A relaxation of Havel 's 3-color problem 显示文摘	Montassier M Raspaud A Wang F W	2008	Information Processing Letters2008，107，：	1
14	Planar graphs without adjacent cycles of length at most seven are 3-colorable 显示文摘	Borodin O V Montassier M Raspaud A	2010	Discrete Mathematics2010，310，：	1
15	Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable 显示文摘	Borodin O V Glebov A N Raspaud A	2010	Discrete Mathematics2010，310，：	1
16	Planar graphs without cycles of length from 4 to 7 are 3-colorable 显示文摘	Borodin OV Glebov A N RasPaud A	2005	Journal of Combinatorial Theory Series B2005，93，2：	1
17	Planar graphs without cycles of length from 4 to 7 are 3-colorable 显示文摘	Borodin O V Glebov A N Raspaud A	2005	J Combin Theory Ser B2005，93，2：	1
18	A sufficient condition for planar graphs to be 3-colorable 显示文摘	Borodin O V Raspaud A	2003	J Combin Theory Ser B2003，88，1：	1
19	Some bounds on the injective chromatic number of graphs显示文摘	Doyon A Hahn G Raspaud A	2010	Discrete Mathematics2010，310，：	1
20	(d,1 )-total labelling of planar graphs with large girth and high maximum degree显示文摘	BAZZARO F MONTASSIER M RASPAUD A	2007	Discrete Math-ematics2007，307，：	1

返回顶部每页显示：

共3页首页上一页第1页下一页末页 /3 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示