Large degree vertices in longest cycles of graphs, II

Large degree vertices in longest cycles of graphs, II

<p>In this paper, we consider the least integer <span class="math"><em>d</em></span> such that every <span class="math"><em>k</em></span>-connected graph <span class="math"><em>G</em></span> o...

Full description

Bibliographic Details
Main Authors: Binlong Li, Liming Xiong, Jun Yin
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2019-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
longest cycle, connectivity, independent number, large degree vertex
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/497

Internet

https://www.ejgta.org/index.php/ejgta/article/view/497

Similar Items