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”

Bounded Stub Resolution for Some Maximal 1-Planar Graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10386670" target="_blank" >RIV/00216208:11320/18:10386670 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007%2F978-3-319-74180-2_18" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-319-74180-2_18</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Bounded Stub Resolution for Some Maximal 1-Planar Graphs

  • Original language description

    The resolution of a drawing plays a crucial role when defining criteria for its quality and readability. In the past, grid resolution, edge-length resolution, angular resolution and crossing resolution have been investigated. We continue the study of the recently introduced stub resolution as an additional aesthetic criterion for nonplanar drawings of graphs. A crossed edge is divided into parts, called stubs, which should not be too short for the sake of readability. Thus, the stub resolution of a drawing is defined as the minimum ratio between the length of a stub and the length of the entire edge containing that stub, over all the edges of the drawing. As a meaningful graph class, where crossings are naturally involved, we consider 1-planar graphs (i.e., graphs that allow planar drawings in which every edge is crossed at most once). In an attempt to prove the conjecture that the stub resolution of 1-planar graphs is bounded, we closely investigate a class of maximal 1-planar graphs arising from double-wheels. We show that each such graph allows a straight-line 1-planar drawing with stub resolution 1/5.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

  • Continuities

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

Others

  • Publication year

    2018

  • 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

    Algorithms and Discrete Applied Mathematics

  • ISBN

    978-3-319-74179-6

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    7

  • Pages from-to

    214-220

  • Publisher name

    SPRINGER

  • Place of publication

    Cham

  • Event location

    Guwahati, India

  • Event date

    Feb 15, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article