3-colorable subclasses of P8-free graphs
نویسندگان
چکیده
In this paper, we study 3-colorable graphs having no induced 8-vertex path and no induced cycles of specific lengths. We prove a characterization by critical graphs in three particular cases.
منابع مشابه
Exhaustive generation of $k$-critical $\mathcal H$-free graphs
We describe an algorithm for generating all k-critical H-free graphs, based on a method of Hoàng et al. Using this algorithm, we prove that there are only finitely many 4-critical (P7, Ck)-free graphs, for both k = 4 and k = 5. We also show that there are only finitely many 4-critical graphs (P8, C4)free graphs. For each case of these cases we also give the complete lists of critical graphs and...
متن کاملExhaustive generation of k-critical H-free graphs
We describe an algorithm for generating all k-critical H-free graphs, based on a method of Hoàng et al. Using this algorithm, we prove that there are only finitely many 4-critical (P7, Ck)-free graphs, for both k = 4 and k = 5. We also show that there are only finitely many 4-critical (P8, C4)-free graphs. For each case of these cases we also give the complete lists of critical graphs and verte...
متن کاملOn-Line 3-Chromatic Graphs I. Triangle-Free Graphs
This is the first half of a two-part paper devoted to on-line 3-colorable graphs. Here on-line 3-colorable triangle-free graphs are characterized by a finite list of forbidden induced subgraphs. The key role in our approach is played by the family of graphs which are both triangleand (2K2 + K1)-free. Characterization of this family is given by introducing a bipartite modular decomposition conce...
متن کاملA Certifying Algorithm for 3-Colorability of P5-Free Graphs
We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colorable and minimal with respect to this property.
متن کاملTriangle-free Uniquely 3-Edge Colorable Cubic Graphs
This paper presents infinitely many new examples of triangle-free uniquely 3-edge colorable cubic graphs. The only such graph previously known was given by Tutte in 1976.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017