The interval number of a planar graph is at most three

TL;DR

This paper proves that every planar graph can be represented as an intersection graph of at most three unions of intervals on the real line, providing a shorter and corrected proof of a known bound.

Contribution

The authors present a new, shorter proof confirming that the interval number of any planar graph is at most three, fixing a flaw in the original proof from 1983.

Findings

Every planar graph has an interval number at most three.

A shorter, corrected proof of the known bound.

Clarification of the interval representation for planar graphs.

Abstract

The interval number of a graph $G$ is the minimum $k$ such that one can assign to each vertex of $G$ a union of $k$ intervals on the real line, such that $G$ is the intersection graph of these sets, i.e., two vertices are adjacent in $G$ if and only if the corresponding sets of intervals have non-empty intersection. In 1983 Scheinerman and West [The interval number of a planar graph: Three intervals suffice. \textit{J.~Comb.~Theory, Ser.~B}, 35:224--239, 1983] proved that the interval number of any planar graph is at most $3$. However the original proof has a flaw. We give a different and shorter proof of this result.