Open AccessLarge degree vertices in longest cycles of graphs, I
Author(s) -
Binlong Li,
Liming Xiong,
Jun Yin
Publication year - 2015
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1861
Subject(s) - combinatorics , mathematics , degree (music) , integer (computer science) , graph , discrete mathematics , computer science , acoustics , programming language , physics
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom