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...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	Chen Bing, Ning Bo
Формат:	Artigo
Хэл сонгох:	Inglês
Хэвлэсэн:	De Gruyter 2016-01-01
Цуврал:	Open Mathematics
Нөхцлүүд:	hamilton cycle almost distance-hereditary graph claw-free graph 1-heavy graph 2-heavy graph claw-heavy graph 05c38 05c45
Онлайн хандалт:	https://doi.org/10.1515/math-2016-0003
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!