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...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2021-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2170 |