Journal of East China Normal University(Natural Sc ›› 2009, Vol. 2009 ›› Issue (1): 7-12.

• Article • Previous Articles     Next Articles

Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)

LU Jun-jie1, REN Han2   

  1. 1. Department of Mathematics, Shanghai jiaotong University, Shanghai 200062, China; 2.Department of Mathematics, East China Normal University, Shanghai 200062, China
  • Received:2008-03-01 Revised:2008-05-13 Online:2009-01-25 Published:2009-01-25
  • Contact: LU Jun-jie

Abstract: Consider a red planar graph and a green planar graph
simutaneously $2$-cell embedded on a surface. With some restriction,
a red edge can cross a green edge. This paper studied the minimum
number of these red-green crosses by using technique of integer
programming, and some results are obtained.

Key words: crossing number, partition, edge-connectivity, planar graph, crossing number, partition, edge-connectivity

CLC Number: