
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)|$.
excluded minor, mathematics, graph theory, minor crossing number, grafovski minor, 05C62; 05C10, 05C83, Graph minors, minorsko prekrižno število, graph minor, info:eu-repo/classification/udc/519.17, Planar graphs; geometric and topological aspects of graph theory, teorija grafov, matematika, FOS: Mathematics, Mathematics - Combinatorics, crossing number, 05C62, Combinatorics (math.CO), graf, prekrižno število, 05C10, 05C83, prepovedan minor
excluded minor, mathematics, graph theory, minor crossing number, grafovski minor, 05C62; 05C10, 05C83, Graph minors, minorsko prekrižno število, graph minor, info:eu-repo/classification/udc/519.17, Planar graphs; geometric and topological aspects of graph theory, teorija grafov, matematika, FOS: Mathematics, Mathematics - Combinatorics, crossing number, 05C62, Combinatorics (math.CO), graf, prekrižno število, 05C10, 05C83, prepovedan minor
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
