Drawings of Complete Multipartite Graphs up to Triangle Flips
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10493340" target="_blank" >RIV/00216208:11320/24:10493340 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=9mmQaOcXE_" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=9mmQaOcXE_</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.20382/jocg.v15i2a5" target="_blank" >10.20382/jocg.v15i2a5</a>
Alternative languages
Result language
angličtina
Original language name
Drawings of Complete Multipartite Graphs up to Triangle Flips
Original language description
We show that for any two simple drawings of a complete multipartite graph with the same extended rotation system, one drawing can be transformed into the other by a sequence of triangle flips.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
<a href="/en/project/GA22-19073S" target="_blank" >GA22-19073S: Combinatorial and computational complexity in topology and geometry</a><br>
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
Name of the periodical
Journal of Computational Geometry
ISSN
1920-180X
e-ISSN
1920-180X
Volume of the periodical
15
Issue of the periodical within the volume
2
Country of publishing house
CA - CANADA
Number of pages
50
Pages from-to
124-173
UT code for WoS article
001420947300005
EID of the result in the Scopus database
—