We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given ...
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
Streams are acyclic directed subgraphs of the logical ow graph of a proof representing bundles of paths with the same origin and the same end. The notion of stream is used to desc...
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...