Hamilton cycles in almost distance-hereditary graphs
Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H). Adopting the terminology introduced by Broersma et al. and Čada, a graph G is called 1-heavy if at leas...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
De Gruyter
2016-01-01
|
| Seri Bilgileri: | Open Mathematics |
| Konular: | |
| Online Erişim: | https://doi.org/10.1515/math-2016-0003 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|