Long cycles in triangle-free graphs with prescribed independence number and connectivity
文献类型：期刊论文
| 作者 | Enomoto, H; Kaneko, A; Saito, A; Wei, B |
| 刊名 | JOURNAL OF COMBINATORIAL THEORY SERIES B
 |
| 出版日期 | 2004-05-01 |
| 卷号 | 91期号:1页码:43-55 |
| 关键词 | longest cycle triangle-free graph independence number connectivity |
| ISSN号 | 0095-8956 |
| DOI | 10.1016/j.jctb.2003.05.002 |
| 英文摘要 | The Chvatal-Erdos theorem says that a 2-connected graph with alpha(G) less than or equal to kappa(G) is hamiltonian. We extend this theorem for triangle-free graphs. We prove that if G is a 2-connected triangle-free graph of order n with alpha(G) less than or equal to 2kappa(G) - 2, then every longest cycle in G is dominating, and G has a cycle of length at least min{n - alpha(G) + kappa(G), n}. (C) 2003 Elsevier Inc. All rights reserved. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000221001900003 |
| 出版者 | ACADEMIC PRESS INC ELSEVIER SCIENCE |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/1005]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Enomoto, H |
| 作者单位 | 1.Keio Univ, Dept Math, Kohoku Ku, Yokohama, Kanagawa 2238522, Japan 2.Kogakuin Univ, Dept Elect Engn, Shinjuku Ku, Tokyo 1638677, Japan 3.Nihon Univ, Dept Math Appl, Setagaya Ku, Tokyo 1568550, Japan 4.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Enomoto, H,Kaneko, A,Saito, A,et al. Long cycles in triangle-free graphs with prescribed independence number and connectivity[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,2004,91(1):43-55. |
| APA | Enomoto, H,Kaneko, A,Saito, A,&Wei, B.(2004).Long cycles in triangle-free graphs with prescribed independence number and connectivity.JOURNAL OF COMBINATORIAL THEORY SERIES B,91(1),43-55. |
| MLA | Enomoto, H,et al."Long cycles in triangle-free graphs with prescribed independence number and connectivity".JOURNAL OF COMBINATORIAL THEORY SERIES B 91.1(2004):43-55. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。