Browsing Mathematics (Faculty of) by Subject "forbidden induced subgraph"
Now showing items 1-3 of 3
-
Complexity of Ck-Coloring in Hereditary Classes of Graphs
(Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019)For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f : V (G) --> V (H) such that for every edge uv E(G) it holds that ... -
Four-coloring P6-free graphs
(Association for Computing Machinery, 2019)In this paper we present a polynomial time algorithm for the 4-COLORING PROBLEM and the 4-PRECOLORING EXTENSION problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. ... -
List 3-Coloring Graphs with No Induced P6+rP3
(Springer Nature, 2021-01-01)For an integer t, we let Pt denote the t-vertex path. We write H+G for the disjoint union of two graphs H and G, and for an integer r and a graph H, we write rH for the disjoint union of r copies of H. We say that a graph ...