The following pages link to Some results on linear arboricity (Q3795688):
Displaying 22 items.
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- An intermediate value theorem for the arboricities (Q554848) (← links)
- Upper bound for linear arboricity (Q809087) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Three ways to cover a graph (Q898135) (← links)
- The linear arboricity of graphs (Q1120581) (← links)
- Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
- Linear \(k\)-arboricities on trees (Q1570841) (← links)
- Factorisation of regular graphs into forests of short paths (Q1584284) (← links)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
- Edge coloring of signed graphs (Q2185748) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- The linear arboricity of some regular graphs (Q3703914) (← links)
- (Q3752419) (← links)
- Linear arboricity of digraphs (Q3794200) (← links)
- Note on linear arboricity of graphs with large girth (Q4005688) (← links)
- (Q4018734) (← links)
- (Q4203044) (← links)
- Almost Every Graph can be Covered by Linear Forests (Q4862746) (← links)
- The list linear arboricity of graphs (Q6056776) (← links)
- An improved bound for the linear arboricity conjecture (Q6081382) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
