<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>The ℤ2-Genus of Kuratowski minors</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LIPIcs</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Radoslav</namePart>
  <namePart type="family">Fulek</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">39F3FFE4-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-8485-1774</description></name>
<name type="personal">
  <namePart type="given">Jan</namePart>
  <namePart type="family">Kynčl</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">UlWa</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>



<name type="conference">
  <namePart>SoCG: Symposium on Computational Geometry</namePart>
</name>



<name type="corporate">
  <namePart>Eliminating intersections in drawings of graphs</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The ℤ2-genus of a graph G is the minimum g such that G has an independently even drawing on the orientable surface of genus g. An unpublished result by Robertson and Seymour implies that for every t, every graph of sufficiently large genus contains as a minor a projective t × t grid or one of the following so-called t-Kuratowski graphs: K3, t, or t copies of K5 or K3,3 sharing at most 2 common vertices. We show that the ℤ2-genus of graphs in these families is unbounded in t; in fact, equal to their genus. Together, this implies that the genus of a graph is bounded from above by a function of its ℤ2-genus, solving a problem posed by Schaefer and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem on orientable surfaces.</abstract>

<originInfo><publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisher><dateIssued encoding="w3cdtf">2018</dateIssued><place><placeTerm type="text">Budapest, Hungary</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host">
  <identifier type="arXiv">1803.05085</identifier><identifier type="doi">10.4230/LIPIcs.SoCG.2018.40</identifier>
<part><detail type="volume"><number>99</number></detail><extent unit="pages">40.1 - 40.14</extent>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/11593</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<apa>Fulek, R., &amp;#38; Kynčl, J. (2018). The ℤ2-Genus of Kuratowski minors (Vol. 99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.SoCG.2018.40&quot;&gt;https://doi.org/10.4230/LIPIcs.SoCG.2018.40&lt;/a&gt;</apa>
<mla>Fulek, Radoslav, and Jan Kynčl. &lt;i&gt;The ℤ2-Genus of Kuratowski Minors&lt;/i&gt;. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14, doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.SoCG.2018.40&quot;&gt;10.4230/LIPIcs.SoCG.2018.40&lt;/a&gt;.</mla>
<ieee>R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 40.1-40.14.</ieee>
<ista>Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14.</ista>
<ama>Fulek R, Kynčl J. The ℤ2-Genus of Kuratowski minors. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:40.1-40.14. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.SoCG.2018.40&quot;&gt;10.4230/LIPIcs.SoCG.2018.40&lt;/a&gt;</ama>
<short>R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14.</short>
<chicago>Fulek, Radoslav, and Jan Kynčl. “The ℤ2-Genus of Kuratowski Minors,” 99:40.1-40.14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.SoCG.2018.40&quot;&gt;https://doi.org/10.4230/LIPIcs.SoCG.2018.40&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>186</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T11:45:05Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-04-14T13:52:37Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
