Cycles throughk vertices in bipartite tournaments |
| |
| Authors: | J Bang-Jensen Y Manoussakis |
| |
| Institution: | (1) Department of Mathematics and Computer Science, Odense University, DK-5230, Denmark;(2) L.R.I. bat 490, Universite de Paris-Sud, 91405 Orsay Cedex, France |
| |
| Abstract: | We give a simple proof that everyk-connected bipartite tournament has a cycle through every set ofk vertices. This was conjectured in 4].This research was done while the first author was visiting Laboratoire de Recherche en Informatique, universite Paris-Sud whose hospitality and financial support is gratefully acknowledged |
| |
| Keywords: | 05 C 20 05 C 38 05 C 40 68 R 10 |
| 本文献已被 SpringerLink 等数据库收录！ |
