<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_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">
  <dc:creator>Galby, Esther</dc:creator>
  <dc:creator>Mazzoleni, María Pía</dc:creator>
  <dc:creator>Ries, Bernard</dc:creator>
  <dc:date>2019</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">In this paper we present a characterization, by an infinite family of minimal forbidden  induced subgraphs, of proper circular arc graphs which are intersection graphs of paths  on a grid, where each path has at most one bend (turn).</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://folia.unifr.ch/global/documents/308002</dc:identifier>
  <dc:identifier>https://folia.unifr.ch/documents/308002/files/properepgcopy_0.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2019.02.010</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:source>Discrete Applied Mathematics. - 2019, vol. 262, p. 195-202</dc:source>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Applied Mathematics</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Discrete Mathematics and Combinatorics</dc:subject>
  <dc:subject>info:eu-repo/classification/udc/004</dc:subject>
  <dc:title xmlns:ns3="xml" ns3:lang="en">Proper circular arc graphs as intersection graphs of pathson a grid</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_6501</dc:type>
</oai_dc:dc>