|
|||||
|
|
An erdős—Gallai conjecture |
|
| Authors: | L Pyber |
| Institution: | (1) Mathematical Institute of the Hungarian Academy of Sciences, P.O.B. 127, 1364 Budapest, Hungary |
| Abstract: | The following conjecture of P. Erdős and T. Gallai is confirmed: every graph onn vertices can be covered byn−1 circuits and edges. |
| Keywords: | 05 C 38 |
| 本文献已被 SpringerLink 等数据库收录！ | |