Cycle packing
<p>In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on <i>n</i> vertices can be partitioned into <i>O</i>(<i>n</i>) cycles and edges. They observed that one can easily get an <i>O</i>(<i>n</i> log <i>...
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | Journal article |
| প্রকাশিত: |
Wiley
2014
|
