DeepAI
Log In Sign Up

Note on 3-Coloring of (2P_4,C_5)-Free Graphs

11/12/2020
by   Vít Jelínek, et al.
0

We show that the 3-coloring problem is polynomial-time solvable on (2P_4,C_5)-free graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/22/2017

Polynomial Cases for the Vertex Coloring Problem

The computational complexity of the Vertex Coloring problem is known for...
11/07/2022

On Fork-free T-perfect Graphs

In an attempt to understanding the complexity of the independent set pro...
07/18/2022

Robust Factorizations and Colorings of Tensor Graphs

Since the seminal result of Karger, Motwani, and Sudan, algorithms for a...
07/08/2021

An Efficient Reduction of a Gammoid to a Partition Matroid

Our main contribution is a polynomial-time algorithm to reduce a k-color...
07/22/2020

A class of graphs with large rankwidth

We describe several graphs of arbitrarily large rankwidth (or equivalent...
05/19/2020

A Frameless 2-Coloring of the Plane Lattice

A picture frame in two dimensions is a rectangular array of symbols, wit...
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...