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...
Sábháilte in:
| Príomhchruthaitheoirí: | , , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
University of Zielona Góra
2021-02-01
|
| Sraith: | Discussiones Mathematicae Graph Theory |
| Ábhair: | |
| Rochtain ar líne: | https://doi.org/10.7151/dmgt.2170 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|