The following pages link to Linear arboricity of digraphs (Q3794200):
Displaying 14 items.
- The linear arboricity of graphs (Q1120581) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- \(n\)-dimensional line digraphs (Q1336657) (← links)
- Bounded degree acyclic decompositions of digraphs. (Q1426101) (← links)
- Linear \(k\)-arboricities on trees (Q1570841) (← links)
- Linear arboricity of regular digraphs (Q2013125) (← links)
- The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
- (Q3073244) (← links)
- Complexité de l'arboricité linéaire d'un graphe II (Q3748293) (← links)
- Linear arboricity of random regular graphs (Q3970908) (← links)
- The list linear arboricity of graphs (Q6056776) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs (Q6184546) (← links)
- Complexity results on the decomposition of a digraph into directed linear forests and out-stars (Q6635181) (← links)