Cycle factors in strongly connected local tournaments (Q965966): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.09.025 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1997206487 / rank | |||
Normal rank |
Revision as of 19:25, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cycle factors in strongly connected local tournaments |
scientific article |
Statements
Cycle factors in strongly connected local tournaments (English)
0 references
27 April 2010
0 references
A digraph \(D\) without directed cycles of length one or two is a local tournament if the in-neighbours as well as the out-neighbours of each vertex of \(D\) induce an ordinary tournament. The authors develop a number of rather technical results on the structure of strong local tournaments that are not cycle complementary. From this they deduce, among other things, results on the number of cut-vertices in such local tournaments and a sufficient condition for a local tournament to have a collection of \(k\) disjoint cycles that collectively include all the vertices of \(D\).
0 references
local tournament
0 references
complementary cycles
0 references
cycle factor
0 references
cut vertices
0 references