Large Degree Vertices in Longest Cycles of Graphs, I

Binlong Li, Liming Xiong, and Jun Yin. "Large Degree Vertices in Longest Cycles of Graphs, I." Discussiones Mathematicae Graph Theory 36.2 (2016): 363-382. <http://eudml.org/doc/277123>.

@article{BinlongLi2016,
abstract = {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.},
author = {Binlong Li, Liming Xiong, Jun Yin},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {longest cycle; large degree vertices; order; connectivity; independent number},
language = {eng},
number = {2},
pages = {363-382},
title = {Large Degree Vertices in Longest Cycles of Graphs, I},
url = {http://eudml.org/doc/277123},
volume = {36},
year = {2016},
}

TY - JOUR
AU - Binlong Li
AU - Liming Xiong
AU - Jun Yin
TI - Large Degree Vertices in Longest Cycles of Graphs, I
JO - Discussiones Mathematicae Graph Theory
PY - 2016
VL - 36
IS - 2
SP - 363
EP - 382
AB - 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.
LA - eng
KW - longest cycle; large degree vertices; order; connectivity; independent number
UR - http://eudml.org/doc/277123
ER -