کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4647449 | 1342352 | 2013 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Obstructions to partitions of chordal graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Obstructions to partitions of chordal graphs Obstructions to partitions of chordal graphs](/preview/png/4647449.png)
چکیده انگلیسی
Matrix partition problems generalize graph colouring and homomorphism problems, and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite set of forbidden induced subgraphs (or perhaps by some other first order condition). We discuss these problems for the class of chordal graphs. In particular, we classify all small matrices M according to whether M-partitionable graphs have finitely or infinitely many minimal chordal obstructions (for all matrices of size less than four), and whether they admit a polynomial time recognition algorithm or are NP-complete (for all matrices of size less than five). We also suggest questions about larger matrices.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 313, Issue 19, 6 October 2013, Pages 1861-1871
Journal: Discrete Mathematics - Volume 313, Issue 19, 6 October 2013, Pages 1861-1871
نویسندگان
Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi,