A note on planar 5-list colouring: non-extendability at distance 4
Discrete Mathematics
Partitioning chordal graphs into independent sets and cliques
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Extending partial 5-colorings and 6-colorings in planar graphs
Journal of Combinatorial Theory Series B
Extending precolorings to circular colorings
Journal of Combinatorial Theory Series B
Distance constraints in graph color extensions
Journal of Combinatorial Theory Series B
Extension problems with degree bounds
Discrete Applied Mathematics
Precoloring extension involving pairs of vertices of small distance
Discrete Applied Mathematics
| Hi-index | 0.00 |