"chromatic number; clique number; Euclidean space; invisibility graph"@en . "Computing and Combinatorics" . . "Valtr, Pavel" . "2010-07-19+02:00"^^ . . . "The invisibility graph I(X) of a set X in a Euclidean space is a (possibly infinite) graph whose vertices are the points of X and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in X. We settle a conjecture of Matou\u0161ek and Valtr claiming that for invisibility graphs of planar sets, the chromatic number cannot be bounded in terms of the clique number." . . "276947" . "RIV/00216208:11320/10:10050547!RIV11-GA0-11320___" . "7"^^ . . . "On three parameters of invisibility graphs" . . "5"^^ . . "3-642-14030-0" . "11320" . . . . . "Cibulka, Josef" . "On three parameters of invisibility graphs"@en . . "Berlin" . . "[1C3C288888B3]" . . "4"^^ . "The invisibility graph I(X) of a set X in a Euclidean space is a (possibly infinite) graph whose vertices are the points of X and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in X. We settle a conjecture of Matou\u0161ek and Valtr claiming that for invisibility graphs of planar sets, the chromatic number cannot be bounded in terms of the clique number."@en . . "Nha Trang, Vietnam" . "On three parameters of invisibility graphs" . "0302-9743" . . "Stola\u0159, Rudolf" . "Springer-Verlag" . "On three parameters of invisibility graphs"@en . . "M\u00E9sz\u00E1ros, Viola" . . "Kyn\u010Dl, Jan" . "P(1M0545), P(GD201/09/H057), S, Z(MSM0021620838)" . . . . "RIV/00216208:11320/10:10050547" . . .