AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of horizontal and vertical segments in the plane, respectively, such that (xi, yj) ∈ E if and only if segments xi and yj intersect. We prove that all planar bipartite graphs have a grid representation, and exhibit some infinite families of graphs with no grid representation—among them the point line incidence graph of projective planes
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are...
International audienceGiven a set S of segments in the plane, the intersection graph of S is the gra...
AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of h...
A graph G is a grid intersection graph if G is the intersection graph of H U I, where H and I are, r...
A necessary and sufficient condition is given for a connected bipartite graph to be the incidence gr...
A necessary and sufficient condition is given for a connected bipartite graph to be the incidence gr...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
Gridline graphs can be realized in the plane with vertices adjacent whenever they are on a common ve...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T11:07:23Z No. of bitstreams:...
AbstractWe show that the class of unit grid intersection graphs properly includes both of the classe...
AbstractGridline graphs can be realized in the plane with vertices adjacent whenever they are on a c...
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are...
International audienceGiven a set S of segments in the plane, the intersection graph of S is the gra...
AbstractA bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of h...
A graph G is a grid intersection graph if G is the intersection graph of H U I, where H and I are, r...
A necessary and sufficient condition is given for a connected bipartite graph to be the incidence gr...
A necessary and sufficient condition is given for a connected bipartite graph to be the incidence gr...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices ...
Gridline graphs can be realized in the plane with vertices adjacent whenever they are on a common ve...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T11:07:23Z No. of bitstreams:...
AbstractWe show that the class of unit grid intersection graphs properly includes both of the classe...
AbstractGridline graphs can be realized in the plane with vertices adjacent whenever they are on a c...
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are...
International audienceGiven a set S of segments in the plane, the intersection graph of S is the gra...
DOI
Add to ORKG