The minor crossing number of graphs with an excluded minor (Q1010709)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The minor crossing number of graphs with an excluded minor |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minor crossing number of graphs with an excluded minor |
scientific article |
Statements
The minor crossing number of graphs with an excluded minor (English)
0 references
7 April 2009
0 references
Summary: 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)|\).
0 references
0.9538051
0 references
0.92380285
0 references
0.9238028
0 references
0.91554207
0 references
0.91356003
0 references
0.9133637
0 references
0.8993562
0 references
