Unavoidable Configurations in Complete Topological Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Crossing-number critical graphs have bounded path-width
Journal of Combinatorial Theory Series B
Crossing number is hard for cubic graphs
Journal of Combinatorial Theory Series B
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Hi-index | 0.00 |