Talk:Ear decomposition
Add topicLatest comment: 10 years ago by Cvanbomm
 | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
I think the first ear (the cycle) can be chosen arbitrarily, both in the 2-edge-connected, 2-connected and strongly connected cases. Please verify this and add the proper statements to the article if they are really true. 157.181.120.94 (talk) 16:10, 28 November 2012 (UTC)
This is not true. --76.116.173.121 (talk) 03:54, 12 February 2015 (UTC)--76.116.173.121 (talk) 03:54, 12 February 2015 (UTC)
The statement (that the first ear/cycle can be chosen arbitrarily) is true for both the 2-connected and 2-edge-connected cases, per Theorems 4.2.8 and 4.2.10 of West[1]. Not sure about the strongly connected case. Cvanbomm (talk) 18:40, 12 August 2015 (UTC)
- ↑ Introduction to Graph Theory - Second edition, Douglas B. West. Published by Prentice Hall 1996, 2001. ISBN 0-13-014400-2