Filters
Intersection Dimension of Bipartite Graphs
We introduce a concept of intersection dimension of a graph with respect to a graph class. This generalizes Ferrers dimension, boxicity, and poset dimension definedas intersection graphs of two kinds of ge...
BA - Obecná matematika
- 2014 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
On-line coloring of geometric intersection graphs
The paper gives approximation bounds for on-line coloring of intersection graphs of disks and squares.
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Intersection graphs of homothetic polygons
We introduce a new class of intersection graphs, prove several results and raise even more open problems.
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Cops and Robbers on intersection graphs
intersection graphs, which are graphs whose vertices are represented by geometric shapes studied classes of intersection graphs: The intersection graphs of arc-connected sets, the in...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Max-Tolerance graphs as intersection graphs: Cliques, cycles and recognition
We show that max-tolerance graphs are intersection graphs of congruent triangles in the plane, and we exploit this representation to show that their recognition is NP-hard, but one can find a maximum clique in polynomial ti...
BA - Obecná matematika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Homothetic polygons and beyond: Maximal cliques in intersection graphs
of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
On unit grid intersection graphs and several other intersection graph classes
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 stri...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Beyond homothetic polygons: recognition and maximum clique
We study the Clique problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-sets intersection graphs and straight-line-segments intersection ...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
String Graphs with Precise Number of Intersections
A string graph is an intersection graph of curves in the plane. A k-string graph is a graph with a string representation in which every pair of curves intersects in at most k points. We introduce ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2024 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Two results on intersection graphs of polygons
We prove asymptotically tight bounds on the number of corners that intersection graphs of polygons require in optimal representations. We also prove that computing this parameter is an NP-hard problem....
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 10 200