Segment representation of a subclass of co-planar graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10126241" target="_blank" >RIV/00216208:11320/12:10126241 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.disc.2012.01.024" target="_blank" >http://dx.doi.org/10.1016/j.disc.2012.01.024</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2012.01.024" target="_blank" >10.1016/j.disc.2012.01.024</a>

Result language
angličtina
Original language name
Segment representation of a subclass of co-planar graphs
Original language description
A graph is a segment graph if its vertices can be mapped to line segments in the plane such that two vertices are adjacent if and only if their corresponding line segments intersect. Kratochvil and Kubena asked the question of whether the complements ofplanar graphs, called co-planar graphs, are segment graphs. We show here that the complements of all partial 2-trees are segment graphs.
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
<a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)