Author:
Belkhechine Houmem,Bouaziz Moncef,Boudabbous Imed,Pouzet Maurice
Reference11 articles.
1. H. Belkhechine, Indécomposabilité des graphes et des tournois, thèse de doctorat, Université Claude-Bernard et Université de Sfax, 15 juillet 2009
2. Morphologie des tournois (−1)-critiques;Belkhechine;C. R. Acad. Sci. Paris Ser. I,2007
3. Graph Theory;Bondy,2008
4. The morphology of infinite tournaments; applications to the growth of their profile;Boudabbous;Europ. J. Combin.,2010
5. Convex circuit-free coloration of an oriented graph;Culus;Europ. J. Combin.,2009
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Invertibility of Digraphs and Tournaments;SIAM Journal on Discrete Mathematics;2024-01-16
2. On the minimum number of inversions to make a digraph k-(arc-)strong;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
3. Making a Tournament Indecomposable by One Subtournament-Reversal Operation;Graphs and Combinatorics;2021-02-26
4. Decomposability index of tournaments;Discrete Mathematics;2017-12