Large Degree Vertices in Longest Cycles of Graphs, I
oleh: Li Binlong, Xiong Liming, Yin Jun
| Format: | Article |
|---|---|
| Diterbitkan: | University of Zielona Góra 2016-05-01 |
Deskripsi
In this paper, we consider the least integer d such that every longest cycle of a k-connected graph of order n (and of independent number α) contains all vertices of degree at least d.