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

27篇 您的检索式：作者名="MONTASSIER M"

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

	题名	作者	年代	出处	被引量
1	Linear choosability of graphs显示文摘	Esperet L Montassier M Raspaud A	2008	Discrete Math2008，308，17：	1
2	L(p, q)-labeling of sparse graphs 显示文摘	CHARPENTIER C MONTASSIER M RASPAUD A	2013	Journal of Combinatorial Opti- mization2013，25，4：	1
3	Star coloring of sparse graphs 显示文摘	BU Y CRANSTON D MONTASSIER M	2009	Journal of Graph Theory2009，62，3：	1
4	A relaxation of Havel 's 3-color problem 显示文摘	Montassier M Raspaud A Wang F W	2008	Information Processing Letters2008，107，：	1
5	Inclusion complexes of tretinoin with cyclodextrins 显示文摘	Montassier P Duchene D Poelman M C	1997	International Journal of Pharmaceutics1997，153，2：	1
6	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
7	Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable 显示文摘	Borodin O V Gtebov A N Montassier M	2009	Journal of Combinatorial Theory Series B2009，99，：	1
8	(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
9	Bordeaux 3-color conjecture and 3-choosability 显示文摘	MONTASSIER M RASPAUD A WANG W	2006	Discrete Math2006，8，6：	1
10	Bordeaux 3-color conjecture and 3-choosability 显示文摘	Montassier M Raspaud A Wang Weifan	2006	Discrete Math2006，306，6：	1
11	A relaxation of Havel's problem 显示文摘	Montassier M Raspaud A Wang Weifan	2008	Information Processing Letters2008，107，34：	1
12	Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five显示文摘	Hoequard H Montassier M	2011	Electronic Notes in Discrete Mathematics2011，38，：	1
13	Adjacent vertex-distinguishing edge coloring of graphs with maximum degree A显示文摘	Hocquard H Montassier M	2013	Journal of Combinatorial Optimiza-tion2013，26，1：	1
14	Inclusion complexes of tretinoin with cyclodextrins 显示文摘	Montassier P Duchene D Poelman M C	1997	Int J Pharm1997，153，2：	1
15	Linear choosability of graphs显示文摘	Esperet L Montassier M Raspaud A	2008	Discrete Math2008，308，17：	1
16	On the acyclic choosability of graphs 显示文摘	MONTASSIER M OCHEM P RASPAUD A	2006	J Graph Theory2006，51，：	1
17	Linear choosability of graphs显示文摘	Esperet L Montassier M Raspaud A	2008	Discrete Math2008，308，17：	1
18	Linear choosability of graphs显示文摘	Esperet L Montassier M Raspaud A	2008	Discrete Math2008，308，17：	1
19	A note on 2 -facial coloring of plane graphs 显示文摘	Montassier M Raspand A	2006	Inf Process Lett2006，98，6：	1
20	(d,1)-Total labelling of planar graphs with large girth aud high maximum degree 显示文摘	Bazzaro F Montassier M Raspaud A	2007	Discrete Math2007，307，：	1

返回顶部每页显示：

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

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

用户提示