Pavel Valtr. Graph Drawings with no k Pairwise Crossing Edges. In Giuseppe Di Battista, editor, Graph Drawing, 5th International Symposium, GD 97, Rome, Italy, September 18-20, 1997, Proceedings. Volume 1353 of Lecture Notes in Computer Science, pages 205-218, Springer, 1997.
@inproceedings{Valtr97, title = {Graph Drawings with no k Pairwise Crossing Edges}, author = {Pavel Valtr}, year = {1997}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Valtr97}, cites = {0}, citedby = {0}, pages = {205-218}, booktitle = {Graph Drawing, 5th International Symposium, GD 97, Rome, Italy, September 18-20, 1997, Proceedings}, editor = {Giuseppe Di Battista}, volume = {1353}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-63938-1}, }