The following pages link to (Q3752419):
Displaying 27 items.
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- The linear arboricity of planar graphs with maximum degree at least 5 (Q456114) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
- The linear arboricity of graphs (Q1120581) (← links)
- A note on the arboricity of graphs (Q1205341) (← links)
- Linear \(k\)-arboricities on trees (Q1570841) (← links)
- The star arboricity of graphs (Q1825208) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles (Q2376098) (← links)
- The linear arboricity of planar graphs without 5-, 6-cycles with chords (Q2376109) (← links)
- On the linear arboricity of graphs embeddable in surfaces (Q2448856) (← links)
- A Planar linear arboricity conjecture (Q2891050) (← links)
- Linear arboricity of digraphs (Q3794200) (← links)
- Note on linear arboricity of graphs with large girth (Q4005688) (← links)
- (Q4018734) (← links)
- (Q4291534) (← links)
- The list linear arboricity of graphs (Q6056776) (← links)
- On the path partition number of 6‐regular graphs (Q6057632) (← links)
- Partitioning edges of a planar graph into linear forests and a matching (Q6081582) (← links)
- Linear arboricity of degenerate graphs (Q6094033) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
- (Q6123718) (← links)
- A decomposition method on solving the linear arboricity conjecture (Q6143389) (← links)
- On the linear arboricity of graphs with treewidth at most four (Q6172210) (← links)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs (Q6184546) (← links)
