Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree

Journal of Graph Theory

Volumn 36, Issue 3, 2001, Pages 168-173

  Garcia Moreno, Enrique ^a,c   Salazar, Gelasio ^b  

^a Col Mixcoac ^*  (Mexico)

^b INSTITUTO DE INVESTIGACIÓN EN COMUNICACIÓN ÓPTICA   (Mexico)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

Crossing number; Graph minors

Indexed keywords

EID: 25444529218     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0118(200103)36:3<168::aid-jgt1004>3.0.co;2-%23     Document Type: Article

References (8)

1. 7, Congr Numer 125 (1997), 97-117.
2. D. Archdeacon, Problems in topological graph theory, currently available at http://www.emba.uvm.edu/~archdeac/problems/problems.html.
3. J. Maharry, 4-Representative toroidal graphs do not embed on the Klein bottle, preprint.
4. A. Riskin, On the nonembeddability and crossing numbers of some toroidal graphs on the Klein bottle, preprint.
5. N. Robertson and P. D. Seymour, Graph Minors. VII. Disjoint paths on a surface, J Combin Theory Ser B 45 (1988), 212-254.
6. n, J Graph Theory, 35 (2000), 222-226.
7. A. Schrijver, Grid minors of graphs on the torus, J Combin Theory Ser B 61 (1994), 57-62.
8. n on surfaces, Disc Comp Geom 19(2) (1998), 237-247.