Add to ORKGA cograph is a graph which does not contain any induced path on four vertices. In this paper, we characterize those cographs that are intersection graphs of paths on a grid in the following two cases: (i) the paths on the grid all have at most one bend and the intersections concern edges (→ B1-EPG); (ii) the paths on the grid are not bended and the intersections concern vertices (→ B0-VPG). In both cases,wegive a characterization by a family of forbidden induced subgraphs.We further present linear- time algorithms to recognize B1-EPG cographs and B0-VPG cographs using their cotree
In this paper, we study the class of PVPG graphs, this is a subclass of VPG graphs such that all the...
We investigate here the intersection graphs of horizontal and vertical line segments in the plane, t...
An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the verti...
A cograph is a graph which does not contain any induced path on four vertices. In this paper, we cha...
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 audienceIn this paper we consider graphs G whose vertices can be represented as single...
AbstractIn this paper we consider graphs G whose vertices can be represented as single-bend paths (i...
In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A ...
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree(resp. in a grid) are well s...
Abstract. In this paper we study properties of intersection graphs of k-bend paths in the rectangula...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
A graph G is a B0-VPG graph if one can associate a horizontal or vertical path on a rectangular grid...
14th Latin American Symposium on Theoretical Informatics, LATIN 2020 -- 5 January 2021 through 8 Jan...
In this paper, we study the class of PVPG graphs, this is a subclass of VPG graphs such that all the...
We investigate here the intersection graphs of horizontal and vertical line segments in the plane, t...
An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the verti...
A cograph is a graph which does not contain any induced path on four vertices. In this paper, we cha...
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 audienceIn this paper we consider graphs G whose vertices can be represented as single...
AbstractIn this paper we consider graphs G whose vertices can be represented as single-bend paths (i...
In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A ...
We investigate graphs that can be represented as vertex intersections of horizontal and vertical pat...
The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree(resp. in a grid) are well s...
Abstract. In this paper we study properties of intersection graphs of k-bend paths in the rectangula...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
A graph G is a B0-VPG graph if one can associate a horizontal or vertical path on a rectangular grid...
14th Latin American Symposium on Theoretical Informatics, LATIN 2020 -- 5 January 2021 through 8 Jan...
In this paper, we study the class of PVPG graphs, this is a subclass of VPG graphs such that all the...
We investigate here the intersection graphs of horizontal and vertical line segments in the plane, t...
An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the verti...