A Note on the Crossing Numbers of 5-Regular Graphs
The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2. This answers a question by Chia and Gan in the negative. In addition, we also give a new proof of C...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2020-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2203 |