On unit grid intersection graphs and several other intersection graph classes

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10406123" target="_blank" >RIV/00216208:11320/19:10406123 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=4uTsktYH05" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=4uTsktYH05</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On unit grid intersection graphs and several other intersection graph classes
Original language description
The article answers several questions about recognition of particular graph classes where the graphs are as sparse as possible. Among other results, it solves the question of Kratochvíl and Pergel from 2008 about recognition of string-graphs with arbitrarily large girth.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA19-08554S" target="_blank" >GA19-08554S: Structures and algorithms in highly symmetric graphs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)