<mods:mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:mods="http://www.loc.gov/mods/v3" version="3.0" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-0.xsd"><mods:titleInfo><mods:title>On representations by contact and intersection of segments</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">Hubert</mods:namePart><mods:namePart type="family">de Fraysseix</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">Patrice</mods:namePart><mods:namePart type="family">Ossona de Mendez</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods: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.</mods:abstract><mods:classification authority="lcc">Z.500 Representations</mods:classification><mods:classification authority="lcc">M.999 Others</mods:classification><mods:classification authority="lcc">P.999 Others</mods:classification><mods:classification authority="lcc">Z.250 Geometry</mods:classification><mods:originInfo><mods:dateIssued encoding="iso8061">2007</mods:dateIssued></mods:originInfo><mods:genre>Journal (Paginated)</mods:genre></mods:mods>