On Finding Paths Passing through Specified Vertices
(2011)
Report
Paulusma, D. (2011). On Finding Paths Passing through Specified Vertices. [No known commissioning body]
We consider undirected finite graphs that have no loops and no multiple edges. A graph is denoted G = (VG, EG), where VG is the set of vertices and EG is the set of edges. A graph containment problem is to decide whether one graph can be modified int... Read More about On Finding Paths Passing through Specified Vertices.