Planar graphs without cycles of length from 4 to 7 are 3-colorable
Journal of Combinatorial Theory Series B
A note on the not 3-choosability of some families of planar graphs
Information Processing Letters
Three-coloring planar graphs without short cycles
Information Processing Letters
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
Discrete Applied Mathematics
On 3-colorable planar graphs without cycles of four lengths
Information Processing Letters
A note on 3-choosability of planar graphs
Information Processing Letters
A relaxation of Havel's 3-color problem
Information Processing Letters
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
Journal of Combinatorial Theory Series B
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
Information Processing Letters
Note: A note on the acyclic 3-choosability of some planar graphs
Discrete Applied Mathematics
A step towards the strong version of Havel's three color conjecture
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |