Topological graphs with no self-intersecting cycle of lenth 4

Rom Pinchasi, Rados Radoicic. Topological graphs with no self-intersecting cycle of lenth 4. In Proceedings of the 19th ACM Symposium on Computational Geometry, June 8-10, 2003, San Diego, CA, USA. pages 98-103, ACM, 2003. [doi]

@inproceedings{PinchasiR03,
  title = {Topological graphs with no self-intersecting cycle of lenth 4},
  author = {Rom Pinchasi and Rados Radoicic},
  year = {2003},
  doi = {10.1145/777792.777807},
  url = {http://doi.acm.org/10.1145/777792.777807},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/PinchasiR03},
  cites = {0},
  citedby = {0},
  pages = {98-103},
  booktitle = {Proceedings of the 19th ACM Symposium on Computational Geometry, June 8-10, 2003, San Diego, CA, USA},
  publisher = {ACM},
  isbn = {1-58113-663-3},
}