Prove the following: you can always find in a simple undirected graph of minimum degree two spanning edge disjoint subgraphs of minimum degree at least . Give also an algorithmic procedure to find such subgraphs.
Fill in your details below or click an icon to log in:
You are commenting using your WordPress.com account. ( Log Out / Change )
You are commenting using your Facebook account. ( Log Out / Change )
Connecting to %s
Notify me of new comments via email.
Notify me of new posts via email.
Δ
Enter your email address to follow this webpage and receive notifications of new posts by email.
Email Address:
Follow
Prove the following: you can always find in a simple undirected graph 
tsourakakis.com 