2-Drawings and the 2-Drawing Number

In the realm of graph theory, a 2-drawing (or 2-line drawing) of a graph is a drawing where no two edges cross. A 2-drawing number, denoted as dr₂(G), represents the minimum number of areas into which a planar drawing of a graph G can be divided by its edges. Essentially, it quantifies how ‘complex’ a graph’s planar embedding can be in terms of region count. This concept is crucial for understanding graph visualization and planarity testing.

Why are 2-Drawings Important?

Understanding 2-drawing numbers has several applications:

• Planarity Testing: A graph is planar if and only if it admits a 2-drawing. Determining the 2-drawing number can aid in verifying planarity.
• Graph Visualization: Minimizing edge crossings is a primary goal in graph visualization. 2-drawings represent the ideal scenario – no crossings at all.
• Computational Geometry: The concept relates to partitioning planes and understanding geometric arrangements.
• Circuit Layout: In VLSI design, minimizing wire crossings is vital for efficient circuit layout.

Calculating the 2-Drawing Number

Determining dr₂(G) isn’t always straightforward. For simple graphs, it can be visually inspected. However, for larger, more complex graphs, algorithmic approaches are needed.

Basic Properties & Bounds

1. dr₂(G) ≥ 1: Every graph has at least one area (the exterior face).
2. dr₂(K_n) = n: The complete graph on n vertices (K_n) has a 2-drawing number of n.
3. dr₂(T) = 1: A tree (T) always has a 2-drawing with only one area.
4. For planar graphs: dr₂(G) is related to the number of faces in a planar embedding (Euler’s formula: V ⎯ E + F = 2, where F is the number of faces).

Examples

Let’s consider a few examples:

• A single edge: dr₂(G) = 2 (the edge divides the plane into two areas).
• A cycle of length n: dr₂(G) = 2 (the cycle forms a single enclosed area and the exterior).
• A square with a diagonal: dr₂(G) = 3 (the diagonal divides the square into two triangles, plus the exterior).

Algorithms and Complexity

Finding the 2-drawing number is generally NP-hard. However, for specific graph classes (e.g., trees, complete graphs), efficient algorithms exist. Approximation algorithms and heuristics are often used for larger graphs where finding the exact value is computationally expensive.

Further Research

The study of 2-drawing numbers continues to be an active area of research in graph theory. Current research focuses on developing more efficient algorithms, exploring relationships with other graph parameters, and applying these concepts to real-world problems.