Timeline for Reference Request for: Finding Large Bipartite Subgraphs via Destruction of Odd Cycles in Graphs
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 29, 2013 at 3:30 | comment | added | Manfred Weis | @masked avenger: two coloring is indeed a good way of attacking the problem; I have already played around with some methods and also devised my own (skip-coloring), but as they do not address the very essence of the problem (namely the existence of odd cycles), I currently don't follow that thread. If you like, I can share my ideas for two-coloring approaches. | |
| Jul 29, 2013 at 0:01 | history | answered | The Masked Avenger | CC BY-SA 3.0 |