Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
The NP-completeness of (1,r)-subcolorability of cubic graphs
Information Processing Letters
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph Subcolorings: Complexity and Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Computing
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
Combinatorics, Probability and Computing
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
3-Coloring and 3-clique-ordering of locally connected graphs
Journal of Algorithms
NP-hard graph problems and boundary classes of graphs
Theoretical Computer Science
Coloring kk-free intersection graphs of geometric objects in the plane
Proceedings of the twenty-fourth annual symposium on Computational geometry
Discrete Applied Mathematics
Linear algorithm for 3-coloring of locally connected graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Covering line graphs with equivalence relations
Discrete Applied Mathematics
Colouring vertices of triangle-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Coloring graphs without short cycles and long induced paths
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The structure of bull-free graphs I-Three-edge-paths with centers and anticenters
Journal of Combinatorial Theory Series B
Coloring Kk-free intersection graphs of geometric objects in the plane
European Journal of Combinatorics
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
Clique-Colouring and biclique-colouring unichord-free graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Coloring graphs characterized by a forbidden subgraph
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
International Journal of Applied Metaheuristic Computing
Colouring of graphs with Ramsey-type forbidden subgraphs
Theoretical Computer Science
List coloring in the absence of two subgraphs
Discrete Applied Mathematics
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics
| Hi-index | 0.06 |