Some results on graphs without long induced paths
Information Processing Letters
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Note: On the complexity of 4-coloring graphs without long induced paths
Theoretical Computer Science
A New Characterization of P6-Free Graphs
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Note on k-Colorability of P5-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Partitioning Graphs into Connected Parts
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Partitioning graphs into connected parts
Theoretical Computer Science
Stable sets in k-colorable P5-free graphs
Information Processing Letters
A Certifying Algorithm for 3-Colorability of P5-Free Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A new characterization of P6-free graphs
Discrete Applied Mathematics
Narrowing down the gap on the complexity of coloring Pk-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Colouring vertices of triangle-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
Theoretical Computer Science
List coloring in the absence of a linear forest
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
4-coloring h-free graphs when h is small
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms
Linear time algorithm for computing a small biclique in graphs without long induced paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
Three complexity results on coloring Pk-free graphs
European Journal of Combinatorics
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics
| Hi-index | 0.00 |