Author of the publication

Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.

, , and . Journal of Graph Theory, 53 (4): 315-332 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Bessy, Stéphane
add a person with the name Bessy, Stéphane
 

Other publications of authors with the same name

Bounds on the exponential domination number., , and . Discrete Mathematics, 340 (3): 494-503 (2017)Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree., , and . Journal of Graph Theory, 53 (4): 315-332 (2006)(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity., , and . CoRR, (2018)Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization., , and . ESA, volume 87 of LIPIcs, page 14:1-14:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments., , and . Journal of Graph Theory, 75 (3): 284-302 (2014)Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture., and . Electron. Notes Discret. Math., (2017)Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture., and . Combinatorica, 27 (6): 659-667 (2007)Kernels for feedback arc set in tournaments., , , , , , and . J. Comput. Syst. Sci., 77 (6): 1071-1078 (2011)Antistrong digraphs., , , and . J. Comb. Theory, Ser. B, (2017)Out-degree reducing partitions of digraphs., , , and . Theor. Comput. Sci., (2018)