Claws in digraphs

DOI10.1016/J.CRMA.2007.10.040MaRDI QIDQ2473004zbMATH OpenOpenAlexFDO

Authors Mekkia Kouider, Amine El Sahili

Publication date 26 February 2008

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.crma.2007.10.040

zbMATH Keywords

clawdigraphtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Review text

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.

Recommendations

• Claws contained in all n-tournaments
• scientific article; zbMATH DE number 4108799
• On claws belonging to every tournament
• Some unavoidable subdigraphs of tournaments
• Claws in rotational tournaments

Cites work

• About paths with two blocks
• scientific article; zbMATH DE number 3902685 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• Nombre chromatique et plus longs chemins d'un graphe

Cited in

(2)

• On avoidable and unavoidable claws
• Claws in rotational tournaments

This page was built for publication: Claws in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473004)