## Abstract

Two embeddings of a graph in a surface S are said to be "equivalent" if they are identical under an homeomorphism of S that is orientation-preserving for orientable S. Two graphs cellularly embedded simultaneously in S are said to be "jointly embedded" if the only points of intersection involve an edge of one graph transversally crossing an edge of the other. The problem is to find equivalent embeddings of the two graphs that minimize the number of these edge-crossings; this minimum we call the "joint crossing number" of the two graphs. In this paper, we calculate the exact value for the joint crossing number for two graphs simultaneously embedded in the projective plane. Furthermore, we give upper and lower bounds when the surface is the torus, which in many cases give an exact answer. In particular, we give a construction for re-embedding (equivalently) the graphs in the torus so that the number of crossings is best possible up to a constant factor. Finally, we show that if one of the embeddings is replaced by its "mirror image," then the joint crossing number can decrease, but not by more than 6.066%

Original language | English |
---|---|

Pages (from-to) | 198-216 |

Number of pages | 19 |

Journal | Journal of Graph Theory |

Volume | 36 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1 Jan 2001 |

Externally published | Yes |

## Keywords

- Crossings
- Toroidal maps