
Polynomial Cases for the Vertex Coloring Problem
The computational complexity of the Vertex Coloring problem is known for...
read it

Breaking the 2^n barrier for 5coloring and 6coloring
The coloring problem (i.e., computing the chromatic number of a graph) c...
read it

An Efficient Reduction of a Gammoid to a Partition Matroid
Our main contribution is a polynomialtime algorithm to reduce a kcolor...
read it

A class of graphs with large rankwidth
We describe several graphs of arbitrarily large rankwidth (or equivalent...
read it

A Frameless 2Coloring of the Plane Lattice
A picture frame in two dimensions is a rectangular array of symbols, wit...
read it

Complexity of C_kcoloring in hereditary classes of graphs
For a graph F, a graph G is Ffree if it does not contain an induced sub...
read it

3Colouring P_tfree graphs without short odd cycles
For any odd t≥ 9, we present a polynomialtime algorithm that solves the...
read it
Note on 3Coloring of (2P_4,C_5)Free Graphs
We show that the 3coloring problem is polynomialtime solvable on (2P_4,C_5)free graphs.
READ FULL TEXT
Comments
There are no comments yet.