Jérémie Chalopin, Daniel Gonçalves. Every planar graph is the intersection graph of segments in the plane: extended abstract. In Michael Mitzenmacher, editor, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. pages 631-638, ACM, 2009. [doi]
@inproceedings{ChalopinG09, title = {Every planar graph is the intersection graph of segments in the plane: extended abstract}, author = {Jérémie Chalopin and Daniel Gonçalves}, year = {2009}, doi = {10.1145/1536414.1536500}, url = {http://doi.acm.org/10.1145/1536414.1536500}, tags = {planar graph, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/ChalopinG09}, cites = {0}, citedby = {0}, pages = {631-638}, booktitle = {Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, editor = {Michael Mitzenmacher}, publisher = {ACM}, isbn = {978-1-60558-506-2}, }