@misc{gdea_3750,
          volume = {47},
          number = {4},
           title = {On representations by contact and intersection of segments},
          author = {Hubert de Fraysseix and Patrice Ossona de Mendez},
            year = {2007},
           pages = {453--463},
         journal = {Algorithmica},
             url = {http://gdea.informatik.uni-koeln.de/750/},
        abstract = {A necessary and sufficient condition is given for a connected bipartite graph to be the incidence graph of a contact family of segments and points. We deduce that any 4-connected 3-colorable plane graph is the contact graph of a family of segments and that any 4-colored planar graph without an induced C4 using 4 colors is the intersection graph of a family of straight line segments.}
}