@article{a80d4608065546e9b017ac8c98fd02b5,
title = "Large degree vertices in longest cycles of graphs, II",
abstract = "In this paper, we consider the least integer d such that every k-connected graph G of order n (and of independent number s) has a longest cycle containing all vertices of degree at least d. We completely determine the d when k = 2. We propose a conjecture for those k-connected graph, where k 3.",
keywords = "Connectivity, Independent number, large degree vertex Mathematics Subject Classification, Longest cycle",
author = "Binlong Li and Liming Xiong and Jun Yin",
note = "Publisher Copyright: {\textcopyright} 2019, Indonesian Combinatorics Society.",
year = "2019",
doi = "10.5614/ejgta.2019.7.2.7",
language = "English",
volume = "7",
pages = "277--299",
journal = "Electronic Journal of Graph Theory and Applications",
issn = "2338-2287",
publisher = "Indonesian Combinatorics Society",
number = "2",
}