Hajo's' conjecture and projective graphs

CSpace

	Hajo's' conjecture and projective graphs
	Fan, GH; Xu, BG
	2002-05-31
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	252 期号:1-3 页码:91-101
摘要	Hajos' conjecture asserts that a simple eulerian graph on n vertices can be decomposed into at most (n - 1)/2 circuits, In this paper, as corollaries of the main result, we show that Hajos' conjecture is true for projective graphs and K-6(-)-minor free graphs. (C) 2002 Elsevier Science B.V. All rights reserved.
关键词	circuit decomposition Eulerian graph projective graph
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000176293900007
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17274
专题	中国科学院数学与系统科学研究院
通讯作者	Fan, GH
作者单位	Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Fan, GH,Xu, BG. Hajo's' conjecture and projective graphs[J]. DISCRETE MATHEMATICS,2002,252(1-3):91-101.
APA	Fan, GH,&Xu, BG.(2002).Hajo's' conjecture and projective graphs.DISCRETE MATHEMATICS,252(1-3),91-101.
MLA	Fan, GH,et al."Hajo's' conjecture and projective graphs".DISCRETE MATHEMATICS 252.1-3(2002):91-101.