|
|||||
|
|
Note on circuits containing specified edges |
|
| Authors: | Carsten Thomassen |
| Affiliation: | Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario, Canada |
| Abstract: | If L is a set of at most l disjoint edges in a graph, then there is a circuit containing all edges of L. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |