List-three-coloring P_t-free graphs with no induced 1-subdivision of K_1,s

06/04/2020
by   Maria Chudnovsky, et al.
0

Let s and t be positive integers. We use P_t to denote the path with t vertices and K_1,s to denote the complete bipartite graph with parts of size 1 and s respectively. The one-subdivision of K_1,s is obtained by replacing every edge {u,v} of K_1,s by two edges {u,w} and {v,w} with a new vertex w. In this paper, we give a polynomial-time algorithm for the list-three-coloring problem restricted to the class of P_t-free graph with no induced 1-subdivision of K_1,s.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2023

List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs

Given a graph G=(V, E) and a list of available colors L(v) for each vert...
research
02/07/2018

Four-coloring P_6-free graphs. I. Extending an excellent precoloring

This is the first paper in a series whose goal is to give a polynomial t...
research
02/07/2018

Four-coloring P_6-free graphs. II. Finding an excellent precoloring

This is the second paper in a series of two. The goal of the series is t...
research
08/03/2020

List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_1,s: a Mim-width Perspective

A colouring of a graph G=(V,E) is a mapping c V→{1,2,…} such that c(u)≠ ...
research
05/04/2020

Complexity of C_k-coloring in hereditary classes of graphs

For a graph F, a graph G is F-free if it does not contain an induced sub...
research
02/11/2018

Separation choosability and dense bipartite induced subgraphs

We study a restricted form of list colouring, for which every pair of li...
research
09/07/2022

On List Coloring with Separation of the Complete Graph and Set System Intersections

We consider the following list coloring with separation problem: Given a...

Please sign up or login with your details

Forgot password? Click here to reset