WDM and directed star arboricity

DOI10.1017/S0963548309990551MaRDI QIDQ3557532zbMATH OpenOpenAlexFDO

Authors Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé

Publication date 23 April 2010

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548309990551

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Bounds on directed star arboricity in some digraph classes
• Colouring paths in directed symmetric trees with applications to WDM routing
• Wavelength assignment in multifiber star networks
• Efficient wavelength routing on directed fiber trees
• Coloring all directed paths in a symmetric tree, with an application to optical networks

Cites work

• On incidence coloring and star arboricity of graphs
• Star arboricity
• The acircuitic directed star arboricity of subcubic graphs is at most four
• The star arboricity of graphs

Cited in

(6)

• Interval incidence graph coloring
• Bounds on directed star arboricity in some digraph classes
• Interval incidence coloring of bipartite graphs
• Spanning galaxies in digraphs
• On spanning galaxies in digraphs
• Complexity results on the decomposition of a digraph into directed linear forests and out-stars

This page was built for publication: WDM and directed star arboricity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557532)