Respected readers, authors and reviewers, you can add comments to this page on any questions about the contribution, review, editing and publication of this journal. We will give you an answer as soon as possible. Thank you for your support!
LU Jun-jie, REN Han. Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)[J]. Journal of East China Normal University (Natural Sciences), 2009, (1): 7-12.
Citation:
LU Jun-jie, REN Han. Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)[J]. Journal of East China Normal University (Natural Sciences), 2009, (1): 7-12.
LU Jun-jie, REN Han. Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)[J]. Journal of East China Normal University (Natural Sciences), 2009, (1): 7-12.
Citation:
LU Jun-jie, REN Han. Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)[J]. Journal of East China Normal University (Natural Sciences), 2009, (1): 7-12.
Consider a red planar graph and a green planar graphsimutaneously $2$-cell embedded on a surface. With some restriction,a red edge can cross a green edge. This paper studied the minimumnumber of these red-green crosses by using technique of integerprogramming, and some results are obtained.
DownLoad: