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”

String Graphs with Precise Number of Intersections

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10476614" target="_blank" >RIV/00216208:11320/24:10476614 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-031-49272-3_6" target="_blank" >https://doi.org/10.1007/978-3-031-49272-3_6</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-49272-3_6" target="_blank" >10.1007/978-3-031-49272-3_6</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    String Graphs with Precise Number of Intersections

  • Original language description

    A string graph is an intersection graph of curves in the plane. A k-string graph is a graph with a string representation in which every pair of curves intersects in at most k points. We introduce the class of (=k)-string graphs as a further restriction of k-string graphs by requiring that every two curves intersect in either zero or precisely k points. We study the hierarchy of these graphs, showing that for any k&gt;0 , (=k)-string graphs are a subclass of (=k+2)-string graphs as well as of (4k) -string graphs; however, there are no other inclusions between the classes of (=k)-string and (=l)-string graphs apart from those that are implied by the above rules.

  • 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2024

  • 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 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part II

  • ISBN

    978-3-031-49271-6

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    15

  • Pages from-to

    78-92

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Palermo, Italie

  • Event date

    Sep 20, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article