Proofs of two minimum circuit cover conjectures

CSpace

	Proofs of two minimum circuit cover conjectures
	Fan, GH
	1998-11-01
发表期刊	JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN	0095-8956
卷号	74 期号:2 页码:353-367
摘要	Let G be a 2-edge-connected graph with m edges and n vertices. The following two conjectures are proved in this paper. (i) The edges of G can be covered by circuits of total length at most m + n - 1. (ii) The vertices of G can be covered by circuits of total length at most 2(n - 1), where n greater than or equal to 2. (C) 1998 Academic Press.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000077120900015
出版者	ACADEMIC PRESS INC ELSEVIER SCIENCE
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13857
专题	中国科学院数学与系统科学研究院
通讯作者	Fan, GH
作者单位	1.Arizona State Univ, Dept Math, Tempe, AZ 85287 USA 2.Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Fan, GH. Proofs of two minimum circuit cover conjectures[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,1998,74(2):353-367.
APA	Fan, GH.(1998).Proofs of two minimum circuit cover conjectures.JOURNAL OF COMBINATORIAL THEORY SERIES B,74(2),353-367.
MLA	Fan, GH."Proofs of two minimum circuit cover conjectures".JOURNAL OF COMBINATORIAL THEORY SERIES B 74.2(1998):353-367.