Large degree vertices in longest cycles of graphs, II
| Main Authors: | Li, Binlong; Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072, P.R. China, Xiong, Liming; School of Mathematics and Statistics, and Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing, 100081, P.R. China, Yin, Jun; School of Computer Science, Qinghai Normal University, Xining, 810008, P.R. China |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2019
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/497 https://www.ejgta.org/index.php/ejgta/article/view/497/pdf_112 |
Daftar Isi:
- In this paper, we consider the least integer d such that every k-connected graph G of order n (and of independent number α) 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.