Removing Independently Even Crossings
SIAM Journal on Discrete Mathematics
Removing independently even crossings
GD'09 Proceedings of the 17th international conference on Graph Drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Toward a theory of planarity: hanani-tutte and planarity variants
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |
If a graph can be drawn in the projective plane so that every two nonadjacent edges cross an even number of times, then the graph can be embedded in the projective plane.