World's most popular travel blog for travel bloggers.

what is edge-disjoint cycles in graph?

, , No Comments
Problem Detail: 

I was reading something about Eulerian Tour and there is one property claiming that:

An undirected graph can be decomposed into edge-disjoint cycles if and only if all of its vertices have even degree.

Can someone explain what is edge-disjoint cycles?

Wikipedia: Eulerian path

Asked By : Kesong Xie
Answered By : HueHang

A set of cycles $C$ of a graph $G=(V,E)$ is edge-disjoint if the cycles $c_i$, $c_j \in C$ have no edges in common.

Best Answer from StackOverflow

Question Source :

3200 people like this

 Download Related Notes/Documents


Post a Comment

Let us know your responses and feedback