We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph can be k-colored. If such a coloring exists, the algorithm will produce one. © 2008 Springer-Verlag Berlin Heidelberg.SCOPUS: cp.kinfo:eu-repo/semantics/publishe
We discuss the computational complexity of determining the chromatic number of graphs without long i...
The Colouring problem is to decide if the vertices of a graph can be coloured with at most k colours...
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (pro...
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph c...
The problem of computing the chromatic number of a P (5)-free graph (a graph which contains no path ...
We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., gr...
We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., gr...
We prove three complexity results on vertex coloring problems restricted to $P_k$-free graphs, i.e.,...
A graph is k-choosable if it admits a proper coloring of its vertices for every assignment of k (pos...
We prove three complexity results on vertex coloring problems restricted to $P_k$-free graphs, i.e.,...
AbstractWe show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to t...
We prove three complexity results on vertex coloring problems restricted to $P_k$-free graphs, i.e.,...
The k-Colouring problem is to decide if the vertices of a graph can be coloured with at most k colou...
The k-Colouring problem is to decide if the vertices of a graph can be coloured with at most k colou...
We prove three complexity results on vertex coloring problems restricted to PkPk-free graphs, i.e., ...
We discuss the computational complexity of determining the chromatic number of graphs without long i...
The Colouring problem is to decide if the vertices of a graph can be coloured with at most k colours...
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (pro...
We present a polynomial-time algorithm determining whether or not, for a fixed k, a P 5-free graph c...
The problem of computing the chromatic number of a P (5)-free graph (a graph which contains no path ...
We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., gr...
We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., gr...
We prove three complexity results on vertex coloring problems restricted to $P_k$-free graphs, i.e.,...
A graph is k-choosable if it admits a proper coloring of its vertices for every assignment of k (pos...
We prove three complexity results on vertex coloring problems restricted to $P_k$-free graphs, i.e.,...
AbstractWe show that the question “Is a graph 3-colorable?” remains NP-complete when restricted to t...
We prove three complexity results on vertex coloring problems restricted to $P_k$-free graphs, i.e.,...
The k-Colouring problem is to decide if the vertices of a graph can be coloured with at most k colou...
The k-Colouring problem is to decide if the vertices of a graph can be coloured with at most k colou...
We prove three complexity results on vertex coloring problems restricted to PkPk-free graphs, i.e., ...
We discuss the computational complexity of determining the chromatic number of graphs without long i...
The Colouring problem is to decide if the vertices of a graph can be coloured with at most k colours...
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (pro...
DOI
Add to ORKG