Improved bounds for some facially constrained colorings

by   Kenny Štorgel, et al.

A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a facially-proper vertex-coloring in which every face is incident with zero or an odd number of vertices of each color. Czap and Jendroľ (in Facially-constrained colorings of plane graphs: A survey, Discrete Math. 340 (2017), 2691–2703), conjectured that 10 colors suffice in both colorings. We present an infinite family of counterexamples to both conjectures. A facial (P_k, P_ℓ)-WORM coloring of a plane graph G is a coloring of the vertices such that G contains no rainbow facial k-path and no monochromatic facial ℓ-path. Czap, Jendroľ and Valiska (in WORM colorings of planar graphs, Discuss. Math. Graph Theory 37 (2017), 353–368), proved that for any integer n≥ 12 there exists a connected plane graph on n vertices, with maximum degree at least 6, having no facial (P_3,P_3)-WORM coloring. They also asked if there exists a graph with maximum degree 4 having the same property. We prove that for any integer n≥ 18, there exists a connected plane graph, with maximum degree 4, with no facial (P_3,P_3)-WORM coloring.


page 1

page 2

page 3

page 4


2-distance (Δ+2)-coloring of sparse graphs

A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...

Coloring Drawings of Graphs

We consider face-colorings of drawings of graphs in the plane. Given a m...

Coloring near-quadrangulations of the cylinder and the torus

Let G be a simple connected plane graph and let C_1 and C_2 be cycles in...

A Frameless 2-Coloring of the Plane Lattice

A picture frame in two dimensions is a rectangular array of symbols, wit...

Short and local transformations between (Δ+1)-colorings

Recoloring a graph is about finding a sequence of proper colorings of th...

Plane augmentation of plane graphs to meet parity constraints

A plane topological graph G=(V,E) is a graph drawn in the plane whose ve...

Propagation time for probabilistic zero forcing

Zero forcing is a coloring game played on a graph that was introduced mo...

Please sign up or login with your details

Forgot password? Click here to reset