QQ客服 官方微博 反馈留言

	The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set
	Lian-Cui Zuo; Jian-Liang Wu; Jia-Zhuang Liu
刊名	Ars Combinatoria: An Australian-Canadian Journal of Combinatorics
	2006
页码	65-76
关键词	integer distance graph vertex linear arboricity path coloring
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/6272802
专题	山东大学
作者单位	1.School of Mathematics, Shandong University, Jinan, 250100, China 2.School of Mathematics, Shandong University, Jinan, 250100, Chin
推荐引用方式 GB/T 7714	Lian-Cui Zuo,Jian-Liang Wu,Jia-Zhuang Liu. The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set[J]. Ars Combinatoria: An Australian-Canadian Journal of Combinatorics,2006:65-76.
APA	Lian-Cui Zuo,Jian-Liang Wu,&Jia-Zhuang Liu.(2006).The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.Ars Combinatoria: An Australian-Canadian Journal of Combinatorics,65-76.
MLA	Lian-Cui Zuo,et al."The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set".Ars Combinatoria: An Australian-Canadian Journal of Combinatorics (2006):65-76.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。