کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6423839 1632593 2011 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the diameter of reconfiguration graphs for vertex colourings
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
On the diameter of reconfiguration graphs for vertex colourings
چکیده انگلیسی
The reconfiguration graph of the k-colourings of a graph G contains as its vertex set the proper vertex k-colourings of G, and two colourings are joined by an edge in the reconfiguration graph if they differ in colour on just one vertex of G. We prove that for a graph G on n vertices that is chordal or chordal bipartite, if G is k-colourable, then the reconfiguration graph of its ℓ-colourings, for ℓ⩾k+1, is connected and has diameter O(n2). We show that this bound is asymptotically tight up to a constant factor.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 38, 1 December 2011, Pages 161-166
نویسندگان
, , , , ,