- Tytuł:
- On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
- Autorzy:
-
Zheng, Wei
Wideł, Wojciech
Wang, Ligong - Powiązania:
- https://bibliotekanauki.pl/articles/32083821.pdf
- Data publikacji:
- 2021-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
implicit degree
implicit o-heavy
implicit f-heavy
implicit c-heavy
Hamilton cycle - Opis:
- A graph G of order n is implicit claw-heavy if in every induced copy of K1,3 in G there are two non-adjacent vertices with sum of their implicit degrees at least n. We study various implicit degree conditions (including, but not limiting to, Ore- and Fan-type conditions) imposing of which on specific induced subgraphs of a 2-connected implicit claw-heavy graph ensures its Hamiltonicity. In particular, we improve a recent result of [X. Huang, Implicit degree condition for Hamiltonicity of 2-heavy graphs, Discrete Appl. Math. 219 (2017) 126–131] and complete the characterizations of pairs of o-heavy and f-heavy subgraphs for Hamiltonicity of 2-connected graphs.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2021, 41, 1; 167-181
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł