Coloring Drawings of Graphs

08/21/2020
by   Christoph Hertrich, et al.
0

We consider face-colorings of drawings of graphs in the plane. Given a multi-graph G together with a drawing Γ(G) in the plane with only finitely many crossings, we define a face-k-coloring of Γ(G) to be a coloring of the maximal connected regions of the drawing, the faces, with k colors such that adjacent faces have different colors. By the 4-color theorem, every drawing of a bridgeless graph has a face-4-coloring. A drawing of a graph is facially 2-colorable if and only if the underlying graph is Eulerian. We show that every graph without degree 1 vertices admits a 3-colorable drawing. This leads to the natural question which graphs G have the property that each of its drawings has a 3-coloring. We say that such a graph G is facially 3-colorable. We derive several sufficient and necessary conditions for this property: we show that every 4-edge-connected graph and every graph admitting a nowhere-zero 3-flow is facially 3-colorable. We also discuss circumstances under which facial 3-colorability guarantees the existence of a nowhere-zero 3-flow. On the negative side, we present an infinite family of facially 3-colorable graphs without a nowhere-zero 3-flow. On the positive side, we formulate a conjecture which has a surprising relation to a famous open problem by Tutte known as the 3-flow-conjecture. We prove our conjecture for subcubic and for K_3,3-minor-free graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2020

Improved bounds for some facially constrained colorings

A facial-parity edge-coloring of a 2-edge-connected plane graph is a fac...
research
12/05/2018

Graph multicoloring reduction methods and application to McDiarmid-Reed's Conjecture

A (a,b)-coloring of a graph G associates to each vertex a set of b color...
research
10/10/2022

Locally irregular edge-coloring of subcubic graphs

A graph is locally irregular if no two adjacent vertices have the same d...
research
07/04/2018

Distance-Two Colorings of Barnette Graphs

Barnette identified two interesting classes of cubic polyhedral graphs f...
research
08/02/2023

Balanced-chromatic number and Hadwiger-like conjectures

Motivated by different characterizations of planar graphs and the 4-Colo...
research
09/26/2019

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...
research
10/21/2021

Convex Hull Escape Perturbation at Embedding Space and Spherical Bins Coloring for 3D Face De-identification

This paper proposes a Convex Hull Escape Perturbation (CHEP) method at E...

Please sign up or login with your details

Forgot password? Click here to reset