An oriented 7-colouring of planar graphs with girth at least 7.
List 2-distance -coloring of planar graphs with girth 6 and .
An oriented colouring of planar graphs with girth at least 4.
Continuation of a 3-coloring from a 7-face onto a plane graph without .
2-distance coloring of sparse planar graphs.
Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6.
List -coloring of sparse plane graphs.
Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.
Representing of K13 as a 2-pire map on the Klein bottle.
On the total coloring of planar graphs.
Proof of Simoes-Pereira's conjectures on locally k-degenerate graphs.
Minimal vertex degree sum of a 3-path in plane maps
Let wₖ be the minimum degree sum of a path on k vertices in a graph. We prove for normal plane maps that: (1) if w₂ = 6, then w₃ may be arbitrarily big, (2) if w₂ < 6, then either w₃ ≤ 18 or there is a ≤ 15-vertex adjacent to two 3-vertices, and (3) if w₂ < 7, then w₃ ≤ 17.
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable.
Minimax degrees of quasiplane graphs without 4-faces.
Sufficient conditions for planar graphs to be 2-distance ()-colourable.
Page 1