کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4650474 1342488 2008 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected
چکیده انگلیسی

Let G   be a graph. For u,v∈V(G)u,v∈V(G) with distG(u,v)=2distG(u,v)=2, denote JG(u,v)={w∈NG(u)∩NG(v)|NG(w)⊆NG(u)∪NG(v)∪{u,v}}JG(u,v)={w∈NG(u)∩NG(v)|NG(w)⊆NG(u)∪NG(v)∪{u,v}}. A graph G   is called quasi claw-free if JG(u,v)≠∅JG(u,v)≠∅ for any u,v∈V(G)u,v∈V(G) with distG(u,v)=2distG(u,v)=2. In 1986, Thomassen conjectured that every 4-connected line graph is hamiltonian. In this paper we show that every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 308, Issue 22, 28 November 2008, Pages 5312–5316
نویسندگان
, , ,