پديدآورندگان :
Sahili A. E sahili@ul.edu.lb 1Faculty of Sciences, Lebanese University, HADAT-Beirut, Lebanon , Mortada M maydoun.mortada@liu.edu.lb Faculty of Sciences, Lebanese University, HADAT-Beirut, Lebanon , Nasser S saranasser1992@hotmail.com Faculty of Sciences, Lebanese University, HADAT-Beirut, Lebanon , Belbachir H hacenebelbachir@gmail.com Faculty of Mathematics, University of Sciences and Technology Houari Boumediene
كليدواژه :
Digraph , maximal out forest , final out forest , backward arc , forward arc , circuit.
چكيده فارسي :
A final (resp. maximal) out forest of a digraph has proven to be a very effective
tool which can be used in order to determine or at least study the structure of
the digraph. In this paper, we study the properties of maximal and final out
forests of a digraph and their impact on the connection between colorings and
orientations. Especially, we study the behavior of circuits in digraphs with
respect to their levels in maximal or final out forests.
