Drawing a disconnected graph on the torus (Extended abstract)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10317806" target="_blank" >RIV/00216208:11320/15:10317806 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S1571065315001511" target="_blank" >http://www.sciencedirect.com/science/article/pii/S1571065315001511</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2015.06.105" target="_blank" >10.1016/j.endm.2015.06.105</a>

Result language
angličtina
Original language name
Drawing a disconnected graph on the torus (Extended abstract)
Original language description
We study drawings of graphs on the torus with crossings allowed. A question posed in [M. DeVos, B. Mohar, and R. Šámal, Unexpected behaviour of crossing sequences, J. Combin. Theory Ser. B 101 (2011), no. 6, 448-463], specialized to the case of the torus, asks, whether for every disconnected graph there is a drawing in the torus with the minimal number of crossings, such that one of the graphs is drawn in a planar disc. We reduce the problem to an interesting question from the geometry of numbers and solve a special case.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)