AbstractContact graphs are a special kind of intersection graphs of geometrical objects in which the objects are not allowed to cross but only to touch each other. Contact graphs of simple curves, and line segments as a special case, in the plane are considered. The curve contact representations are studied with respect to the maximal clique and the chromatic number of the represented graphs. All possible curve contact representations of cliques are described, and a linear bound on chromatic number in the maximal clique size is proved for the curve contact graphs
We consider l-graphs, that is contact graphs of axis-aligned l-shapes in the plane, all with the sam...
Contact and intersection representations of graphs and particularly of planar graphs have been studi...
Abstract. We consider L-graphs, that is contact graphs of axis-aligned L-shapes in the plane, all wi...
AbstractContact graphs are a special kind of intersection graphs of geometrical objects in which the...
Contact graphs are a special kind of intersection graphs of geometrical objects in which we do not a...
AbstractContact graphs are a special kind of intersection graphs of geometrical objects in which the...
Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects...
AbstractContact graphs are a special kind of intersection graphs of geometrical objects in which the...
A necessary and sufficient condition is given for a connected bipartite graph to be the incidence gr...
It is proved that any plane graph may be represented by a triangle contact system, that is a collect...
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which ther...
AbstractLet V be a set of curves in the plane. The corresponding intersection graph has V as the set...
Known realizations of geometric representations of graphs, like contact, intersection etc., are "con...
AbstractIn this paper we show that the chromatic number of intersection graphs of congruent geometri...
A family of Jordan arcs, such that two arcs are nowhere tangent, defines a hypergraph whose vertices...
We consider l-graphs, that is contact graphs of axis-aligned l-shapes in the plane, all with the sam...
Contact and intersection representations of graphs and particularly of planar graphs have been studi...
Abstract. We consider L-graphs, that is contact graphs of axis-aligned L-shapes in the plane, all wi...
AbstractContact graphs are a special kind of intersection graphs of geometrical objects in which the...
Contact graphs are a special kind of intersection graphs of geometrical objects in which we do not a...
AbstractContact graphs are a special kind of intersection graphs of geometrical objects in which the...
Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects...
AbstractContact graphs are a special kind of intersection graphs of geometrical objects in which the...
A necessary and sufficient condition is given for a connected bipartite graph to be the incidence gr...
It is proved that any plane graph may be represented by a triangle contact system, that is a collect...
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which ther...
AbstractLet V be a set of curves in the plane. The corresponding intersection graph has V as the set...
Known realizations of geometric representations of graphs, like contact, intersection etc., are "con...
AbstractIn this paper we show that the chromatic number of intersection graphs of congruent geometri...
A family of Jordan arcs, such that two arcs are nowhere tangent, defines a hypergraph whose vertices...
We consider l-graphs, that is contact graphs of axis-aligned l-shapes in the plane, all with the sam...
Contact and intersection representations of graphs and particularly of planar graphs have been studi...
Abstract. We consider L-graphs, that is contact graphs of axis-aligned L-shapes in the plane, all wi...