Graphoidal covers of a graph: a creative review
S. Arumugam, B. Devadas Acharya, E. Sampathkumar · 1997
Review : Given an (infinite) graph G, by a graphoidal cover of G is meant a collection ψ of nontrivial paths in G, which are not necessarily open, such that every vertex of G is an internal vertex of at most one path in ψ and every edge of G is in exactly one path in ψ. The authors give a comprehensive survey of known results about graphoidal covers of finite graphs and related problems.