<ctx:context-object xmlns:xsi="http://www.w3.org/2001/XML" xmlns:ctx="info:ofi/fmt:xml:xsd:ctx" timestamp="2008-09-18T11:09:03Z" xsi:schemaLocation="info:ofi/fmt:xml:xsd:ctx http://www.openurl.info/registry/docs/info:ofi/fmt:xml:xsd:ctx"><ctx:referent><ctx:identifier>info:oai:generic.eprints.org:750</ctx:identifier><ctx:metadata-by-val><ctx:format>info:ofi/fmt:xml:xsd:oai_dc</ctx:format><ctx:metadata><oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/">
        <dc:title>On representations by contact and intersection of segments</dc:title>
        <dc:creator>de Fraysseix, Hubert</dc:creator>
        <dc:creator>Ossona de Mendez, Patrice</dc:creator>
        <dc:subject>Z.500 Representations</dc:subject>
        <dc:subject>M.999 Others</dc:subject>
        <dc:subject>P.999 Others</dc:subject>
        <dc:subject>Z.250 Geometry</dc:subject>
        <dc:description>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.</dc:description>
        <dc:date>2007</dc:date>
        <dc:type>Journal (Paginated)</dc:type>
        <dc:type>PeerReviewed</dc:type>
        <dc:identifier>de Fraysseix, Hubert and Ossona de Mendez, Patrice (2007) On representations by contact and intersection of segments. [Journal (Paginated)]</dc:identifier>
        <dc:relation>http://gdea.informatik.uni-koeln.de/750/</dc:relation></oai_dc:dc></ctx:metadata></ctx:metadata-by-val></ctx:referent></ctx:context-object>