Publication details

On crossing-critical graphs

Authors

HLINĚNÝ Petr

Year of publication 2005
Type Conference abstract
MU Faculty or unit

Faculty of Informatics

Citation
Description We review the crossing number problem, and some results and questions concerning crossing-critical graphs. Namely we show that a conjecture that crossing-critical graphs have bounded pathwidth is deeply false in the projective plane.

You are running an old browser version. We recommend updating your browser to its latest version.

More info