Highly Influential

A 2-graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most two paths in ψ and every edge of G is in exactly one path in ψ. The minimum cardinality of a 2-graphoidal cover of G is called the 2-graphoidal covering number of G… (More)

### Presentations referencing similar topics