|
|||||
|
|
Highly connected non-2-linked digraphs |
|
| Authors: | Carsten Thomassen |
| Affiliation: | (1) Mathematical Institute, The Technical University of Denmark, Building 303, DK-2800 Lyngby, Denmark |
| Abstract: | For every natural numberk there exists a stronglyk-connected digraph which contains two vertices through which there is no directed cycle. |
| Keywords: | 05C20 |
| 本文献已被 SpringerLink 等数据库收录！ | |