کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4649230 1342446 2006 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Partition the vertices of a graph into one independent set and one acyclic set
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Partition the vertices of a graph into one independent set and one acyclic set
چکیده انگلیسی

For a given graph G, if the vertices of G can be partitioned into an independent set and an acyclic set, then we call G a near-bipartite graph. This paper studies the recognition of near-bipartite graphs. We give simple characterizations for those near-bipartite graphs having maximum degree at most 3 and those having diameter 2. We also show that the recognition of near-bipartite graphs is NP-complete even for graphs where the maximum degree is 4 or where the diameter is 4.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 306, Issue 12, 28 June 2006, Pages 1207–1216
نویسندگان
, ,