Large degree vertices in longest cycles of graphs, II

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....

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsmän: Li, Binlong; Department of Applied Mathematics, Northwestern Polytechnical University, Xi'an, Shaanxi 710072, P.R. China (Författare, medförfattare), Xiong, Liming; School of Mathematics and Statistics, and Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing, 100081, P.R. China (Författare, medförfattare), Yin, Jun; School of Computer Science, Qinghai Normal University, Xining, 810008, P.R. China (Författare, medförfattare)
Materialtyp: EJournal Article
Publicerad: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2019-10-10.
Ämnen:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Länkar:Get Fulltext
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Internet

Get Fulltext

3rd Floor Main Library

Beståndsuppgifter i 3rd Floor Main Library
Signum: A1234.567
Exemplar 1 Tillgänglig

Liknande verk