<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://hdl.handle.net/2117/3198">
    <title>DSpace Collection:</title>
    <link>http://hdl.handle.net/2117/3198</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://hdl.handle.net/2117/8413" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/3013" />
      </rdf:Seq>
    </items>
    <dc:date>2013-06-18T06:32:27Z</dc:date>
  </channel>
  <item rdf:about="http://hdl.handle.net/2117/8413">
    <title>Strong product of graphs: Geodetic and hull number and boundary-type sets</title>
    <link>http://hdl.handle.net/2117/8413</link>
    <description>Title: Strong product of graphs: Geodetic and hull number and boundary-type sets
Authors: Cáceres, José; Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel; Puertas González, María Luz</description>
    <dc:date>2010-07-27T09:58:31Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/3013">
    <title>4-labelings and grid embeddings of plane quadrangulations</title>
    <link>http://hdl.handle.net/2117/3013</link>
    <description>Title: 4-labelings and grid embeddings of plane quadrangulations
Authors: Barrière Figueroa, Eulalia; Huemer, Clemens
Abstract: We show that each quadrangulation on $n$ vertices has a closed rectangle of influence drawing on the $(n-2) \times (n-2)$ grid. &#xD;
Further, we present a simple algorithm to obtain a straight-line drawing of a quadrangulation on the &#xD;
$\Big\lceil\frac{n}{2}\Big\rceil \times \Big\lceil\frac{3n}{4}\Big\rceil$ grid. &#xD;
This is not optimal but has the advantage over other existing algorithms that it is not needed to add edges to &#xD;
the quadrangulation to make it $4$-connected. &#xD;
The algorithm is based on angle labeling  and simple face counting in regions analogous to Schnyder's grid embedding for triangulation. &#xD;
This extends previous results on book embeddings for quadrangulations from Felsner, Huemer, Kappes, and Orden (2008).&#xD;
Our approach also yields a representation of a quadrangulation as a pair of rectangulations with a curious property.</description>
    <dc:date>2009-06-09T12:59:27Z</dc:date>
  </item>
</rdf:RDF>

