Large degree vertices in longest cycles of graphs, II
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....
Збережено в:
Автори: | , , |
---|---|
Формат: | EJournal Article |
Опубліковано: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2019-10-10.
|
Предмети: | |
Онлайн доступ: | Get Fulltext |
Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Інтернет
Get Fulltext3rd Floor Main Library
Шифр: |
A1234.567 |
---|---|
Примірник 1 | Доступно |