Crossing-critical graphs with large maximum degree
Combinatorics
2011-01-14 v1
Abstract
A conjecture of Richter and Salazar about graphs that are critical for a fixed crossing number is that they have bounded bandwidth. A weaker well-known conjecture of Richter is that their maximum degree is bounded in terms of . In this note we disprove these conjectures for every , by providing examples of -crossing-critical graphs with arbitrarily large maximum degree.
Cite
@article{arxiv.0907.1599,
title = {Crossing-critical graphs with large maximum degree},
author = {Zdenek Dvorak and Bojan Mohar},
journal= {arXiv preprint arXiv:0907.1599},
year = {2011}
}