[Paper Review] Coloring planar graphs with triangles far apart

Zdenĕk Dvořák, Daniel Král͏̌+1 more|arXiv (Cornell University)|Nov 4, 2009

Advanced Graph Theory Research23 citations

TL;DR

This paper resolves a long-standing problem by proving that planar graphs in which every pair of triangles is separated by a distance of at least d (for some absolute constant d) are 3-colorable. It establishes a general framework for 3-coloring planar graphs with constraints on subgraphs of bounded size, provided these subgraphs are sufficiently far apart and contain all triangles in the graph.

ABSTRACT

We settle a problem of Havel by showing that there exists an absolute constant d such that if G is a planar graph in which every two distinct triangles are at distance at least d, then G is 3-colorable. In fact, we prove a more general theorem. Let G be a planar graph, and let H be a set of connected subgraphs of G, each of bounded size, such that every two distinct members of H are at least a specified distance apart and all triangles of G are contained in \bigcup{H}. We give a sufficient condition for the existence of a 3-coloring phi of G such that for every B\in H, the restriction of phi to B is constrained in a specified way.

Motivation & Objective

• To resolve a conjecture by Havel concerning the 3-colorability of planar graphs with triangles sufficiently far apart.
• To generalize the 3-coloring condition beyond triangles to arbitrary connected subgraphs of bounded size.
• To provide a sufficient condition for the existence of a 3-coloring that respects specified constraints on subgraphs.
• To formalize a distance-based separation condition between subgraphs that ensures 3-colorability under constraint propagation.
• To unify and extend prior results on distance constraints and 3-coloring in planar graphs.

Proposed method

• Define a set H of connected subgraphs of bounded size in a planar graph G, such that all triangles of G are contained in the union of H.
• Impose a minimum distance between any two distinct members of H to ensure structural independence.
• Formulate constraints on the 3-coloring of each subgraph B ∈ H, specifying allowed colorings.
• Use structural graph theory and discharging methods to show that such constraints can be satisfied globally.
• Leverage the planarity of G and the separation of subgraphs to avoid local coloring conflicts.
• Prove that under the given distance and size conditions, a global 3-coloring respecting all local constraints exists.

Experimental results

Research questions

• RQ1 What is the minimal distance d between triangles in a planar graph that guarantees 3-colorability?
• RQ2 Can the 3-coloring condition be extended from triangles to arbitrary bounded-size subgraphs with similar distance constraints?
• RQ3 Under what conditions can local coloring constraints on subgraphs be extended to a global 3-coloring of the entire planar graph?
• RQ4 How does the separation distance between subgraphs influence the feasibility of constrained 3-colorings?
• RQ5 Can a general framework be developed that ensures 3-colorability when all triangles are contained within a set of well-separated, bounded subgraphs?

Key findings

• There exists an absolute constant d such that any planar graph with all pairs of distinct triangles at distance at least d is 3-colorable.
• The paper establishes a general sufficient condition for the existence of a 3-coloring that respects specified constraints on each subgraph in a set H of bounded, well-separated subgraphs.
• The result holds even when the subgraphs in H are not necessarily triangles, as long as they are connected, of bounded size, and pairwise sufficiently far apart.
• All triangles in the graph are contained within the union of the subgraphs in H, ensuring that the constraint set is comprehensive.
• The framework allows for flexible local coloring constraints on each subgraph, enabling applications beyond simple triangle avoidance.
• The proof technique combines structural analysis of planar graphs with constraint propagation, leveraging the independence induced by distance separation.