KMS Of Academy of mathematics and systems sciences, CAS
A short proof of Fan's theorem | |
Feng, T | |
2004-09-28 | |
Source Publication | DISCRETE MATHEMATICS |
ISSN | 0012-365X |
Volume | 286Issue:3Pages:285-286 |
Abstract | In this note, we give a new short proof of the following theorem: Let G be a 2-connected graph of order n. If for any two vertices a and v with d(u, v) = 2, max{d(u), d(v)}greater than or equal toc/2, then the circumference of G is at least c, where 3less than or equal tocless than or equal ton and d(u, v) is the distance between a and v in G. (C) 2004 Elsevier B.V. All rights reserved. |
Keyword | circumference distance |
DOI | 10.1016/j.disc.2004.05.012 |
Language | 英语 |
WOS Research Area | Mathematics |
WOS Subject | Mathematics |
WOS ID | WOS:000224138200017 |
Publisher | ELSEVIER SCIENCE BV |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/19718 |
Collection | 中国科学院数学与系统科学研究院 |
Affiliation | Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China |
Recommended Citation GB/T 7714 | Feng, T. A short proof of Fan's theorem[J]. DISCRETE MATHEMATICS,2004,286(3):285-286. |
APA | Feng, T.(2004).A short proof of Fan's theorem.DISCRETE MATHEMATICS,286(3),285-286. |
MLA | Feng, T."A short proof of Fan's theorem".DISCRETE MATHEMATICS 286.3(2004):285-286. |
Files in This Item: | ||||||
There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment