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

DOI10.1016/j.disc.2006.06.007zbMath1106.05050OpenAlexW2025238842MaRDI QIDQ856877

Alexandre Pinlou, Eric Sopena

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.007

zbMATH Keywords

directed star forest

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

WDM and Directed Star Arboricity

Cites Work

• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• On incidence coloring and star arboricity of graphs
• The star arboricity of graphs
• Acyclic and oriented chromatic numbers of graphs
• Oriented graph coloring
• Unnamed Item

This page was built for publication: The acircuitic directed star arboricity of subcubic graphs is at most four