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

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00307095
Contributor : Eric Sopena <>
Submitted on : Monday, July 28, 2008 - 6:43:41 PM
Last modification on : Thursday, January 11, 2018 - 6:20:15 AM
Long-term archiving on : Saturday, November 26, 2016 - 12:19:11 AM

File

ps0_a.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00307095, version 1

Collections

Citation

Alexandre Pinlou, Eric Sopena. The acircuitic directed star arboricity of subcubic graphs is at most four. Discrete Mathematics, Elsevier, 2006, 306, pp.3281--3289. ⟨hal-00307095⟩

Share

Metrics

Record views

156

Files downloads

52