Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Lia Binlong"'
Autor:
Lia Binlong, Zhang Shenggui
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 2, Pp 383-392 (2016)
Let G be a graph on n vertices. A vertex of G with degree at least n/2 is called a heavy vertex, and a cycle of G which contains all the heavy vertices of G is called a heavy cycle. In this note, we characterize graphs which contain no heavy cycles.
Externí odkaz:
https://doaj.org/article/2c00d234d7704d0baa12449c43f86f2d
