The Minor Crossing Number of Graphs with an Excluded Minor
| dc.creator | Bokal, Drago | |
| dc.creator | Fijavž, Gašper | |
| dc.creator | Wood, David R. | |
| dc.date | 2006-09-25 | |
| dc.date | 2006-12-07 | |
| dc.date.accessioned | 2026-07-07T10:01:30Z | |
| dc.date.available | 2026-07-07T10:01:30Z | |
| dc.description | The "minor crossing number" of a graph $G$ is the minimum crossing number of a graph that contains $G$ as a minor. It is proved that for every graph $H$ there is a constant $c$, such that every graph $G$ with no $H$-minor has minor crossing number at most $c|V(G)|$. | |
| dc.identifier | https://arxiv.org/abs/math/0609707 | |
| dc.identifier | http://arxiv.org/abs/math/0609707 | |
| dc.identifier | Electronic J. Combinatorics 15:R4, 2008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168651 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C62; 05C10, 05C83 | |
| dc.title | The Minor Crossing Number of Graphs with an Excluded Minor | |
| dc.type | text |