Minor-monotone crossing number
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
A Minor
◽
International audience The minor crossing number of a graph $G$, $rmmcr(G)$, is defined as the minimum crossing number of all graphs that contain $G$ as a minor. We present some basic properties of this new minor-monotone graph invariant. We give estimates on mmcr for some important graph families using the topological structure of graphs satisfying \$mcr(G) ≤k$.
1995 ◽
Vol 65
(2)
◽
pp. 291-304
◽
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
Keyword(s):
1999 ◽
Vol Vol. 3 no. 4
◽
Keyword(s):
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
Keyword(s):
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
Keyword(s):