Claws in digraphs (Q2473004): 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.crma.2007.10.040 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2046117456 / rank | |||
Normal rank |
Revision as of 23:09, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Claws in digraphs |
scientific article |
Statements
Claws in digraphs (English)
0 references
26 February 2008
0 references
A rooted tree is a tree with a specified vertex called the root of the tree. An in-branching is an orientation of a rooted tree in which every vertex except the root has out degree 1. A claw is an in-branching in which only the root may have an in degree more than 2. The paper studies the existence of claws in digraph, thereby extending a result of \textit{M. Saks} and \textit{V. T. Sós} [Colloq. Math. Soc. János Bolyai 37, 663--674 (1984; Zbl 0566.05032)] to the tournament-like digraphs.
0 references
digraph
0 references
claw
0 references
tournament
0 references