Large Degree Vertices in Longest Cycles of Graphs, I
Binlong Li, Liming Xiong, Jun Yin (2016)
Discussiones Mathematicae Graph Theory
Similarity:
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.