Let G be a graph, two distinct vertices, and and two different u, v-paths. Viewing these graphs as subgraphs of G, show that constitutes a disjoint union of cycles in G. Does the same hold for digraphs?
Follow Math Help Forum on Facebook and Google+
View Tag Cloud
LinkBack URL
About LinkBackstwo distinct vertices, and
and
two different u, v-paths. Viewing these graphs as subgraphs of G, show that
constitutes a disjoint union of cycles in G. Does the same hold for digraphs?
