摘要
In this paper, we consider the least integer d such that every longest cycle of a κ-connected graph of order n (and of independent number α) contains all vertices of degree at least d.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 363-382 |
| 页数 | 20 |
| 期刊 | Discussiones Mathematicae - Graph Theory |
| 卷 | 36 |
| 期 | 2 |
| DOI | |
| 出版状态 | 已出版 - 2016 |
指纹
探究 'Large degree vertices in longest cycles of graphs, I' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver