All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10332087" target="_blank" >RIV/00216208:11320/16:10332087 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-50106-2_35" target="_blank" >http://dx.doi.org/10.1007/978-3-319-50106-2_35</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-50106-2_35" target="_blank" >10.1007/978-3-319-50106-2_35</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane

  • Original language description

    We reprove the strong Hanani-Tutte theorem on the projective plane. In contrast to the previous proof by Pelsmajer, Schaefer and Stasi, our method is constructive and does not rely on the characterization of forbidden minors, which gives hope to extend it to other surfaces. Moreover, our approach can be used to provide an efficient algorithm turning a Hanani-Tutte drawing on the projective plane into an embedding.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GJ16-01602Y" target="_blank" >GJ16-01602Y: Topological and geometric approaches to classes of permutations and graph properties</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Graph Drawing and Network Visualization

  • ISBN

    978-3-319-50105-5

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    14

  • Pages from-to

    454-467

  • Publisher name

    Springer International Publishing

  • Place of publication

    Neuveden

  • Event location

    Athény

  • Event date

    Sep 19, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article