International audienceA graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs. Here we answer this question by listing all graphs that are not path graphs and are minimal with this property
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a di...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a di...
Path graphs are intersection graphs of paths in a tree. We start from the characterization of path g...
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
AbstractA graph is called a directed vertex (DV) graph if it is the intersection graph of a family o...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a di...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a di...
Path graphs are intersection graphs of paths in a tree. We start from the characterization of path g...
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
A directed path graph is the intersection graph of a family of directed subpaths of a directed tree....
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
AbstractA graph is called a directed vertex (DV) graph if it is the intersection graph of a family o...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph cl...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a di...
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a di...
DOI
Add to ORKG