On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
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 specifi...
I tiakina i:
| Ngā kaituhi matua: | , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
University of Zielona Góra
2021-02-01
|
| Rangatū: | Discussiones Mathematicae Graph Theory |
| Ngā marau: | |
| Urunga tuihono: | https://doi.org/10.7151/dmgt.2170 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|