Proof that if a biconnected component has an odd cycle, then ALL edges in such component belong to some odd cycle?

Правка en1, от pabloskimg, 2018-04-28 08:08:52

Is it true that if a biconnected component has an odd cycle, then ALL edges in that component belong to some (not necessarily the same) odd cycle? If that's the case, what would be a formal proof for that? I believe this property would be crucial to solve this problem: http://codeforces.net/problemset/problem/97/E

Теги biconnected-components, odd cycle

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский pabloskimg 2018-04-28 09:29:16 28
en1 Английский pabloskimg 2018-04-28 08:08:52 429 Initial revision (published)