Heavy Subgraphs, Stability and Hamiltonicity
Let G be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that G is 2-heavy if every induced claw (K1,3) of G contains two end-vertices each one has degree at least |V (G)|/2; and G is o-heavy if every induced claw of G contains two end-vertices with degree sum at...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
University of Zielona Góra
2017-08-01
|
| Ráidu: | Discussiones Mathematicae Graph Theory |
| Fáttát: | |
| Liŋkkat: | https://doi.org/10.7151/dmgt.1967 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|