# Graphs with at most one crossing

## TL;DR

This paper provides a structural characterization of graphs that have a crossing number of exactly one, helping to understand the properties of such graphs and their drawings.

## Contribution

It introduces a new structural characterization of graphs with crossing number one, advancing the theoretical understanding of graph drawings.

## Key findings

- Characterization of graphs with crossing number one
- Structural properties that determine crossing number
- Insights into graph drawing complexity

## Abstract

The crossing number of a graph $G$ is the least number of crossings over all possible drawings of $G$. We present a structural characterization of graphs with crossing number one.