Logo image
Se connecter
The acircuitic directed star arboricity of subcubic graphs is at most four
Article de revue   Avec comité de lecture

The acircuitic directed star arboricity of subcubic graphs is at most four

Alexandre Pinlou et Eric Sopena
Discrete mathematics, Vol.306(24), pp.3281-3289
28/12/2006

Résumé

Computer Science Discrete Mathematics Autre
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G (that is a digraph with no opposite arcs) is the minimum number of edge-disjoint directed star forests whose union covers all edges of G and such that the union of any two such forests is acircuitic. We show that every subcubic graph has acircuitic directed star arboricity at most four.

Indicateurs

1 Consultations de la notice

Détails

Logo image