跳到主要导航 跳到搜索 跳到主要内容

Large degree vertices in longest cycles of graphs, I

  • Binlong Li
  • , Liming Xiong
  • , Jun Yin
  • Northwestern Polytechnical University Xian
  • University of West Bohemia
  • Beijing Institute of Technology
  • Qinghai Normal University

科研成果: 期刊稿件文章同行评审

摘要

In this paper, we consider the least integer d such that every longest cycle of a κ-connected graph of order n (and of independent number α) contains all vertices of degree at least d.

源语言英语
页(从-至)363-382
页数20
期刊Discussiones Mathematicae - Graph Theory
36
2
DOI
出版状态已出版 - 2016

指纹

探究 'Large degree vertices in longest cycles of graphs, I' 的科研主题。它们共同构成独一无二的指纹。

引用此