Pages that link to "Item:Q3522847"
From MaRDI portal
The following pages link to The linear arboricity of planar graphs of maximum degree seven is four (Q3522847):
Displaying 27 items.
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- Edge covering pseudo-outerplanar graphs with forests (Q449118) (← 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)
- Three ways to cover a graph (Q898135) (← links)
- The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
- The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
- Towards the linear arboricity conjecture (Q1985445) (← links)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
- Linear arboricity of outer-1-planar graphs (Q2033994) (← links)
- The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
- Edge coloring of signed graphs (Q2185748) (← links)
- The list linear arboricity of planar graphs with 7-cycles containing at most two chords (Q2286100) (← links)
- Linear arboricity of NIC-planar graphs (Q2300535) (← links)
- The linear arboricity of planar graphs without 5-, 6-cycles with chords (Q2376109) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- On the linear arboricity of graphs embeddable in surfaces (Q2448856) (← links)
- A planar linear arboricity conjecture (Q2891050) (← links)
- (Q3806279) (← links)
- On the linear arboricity of planar graphs (Q4248536) (← links)
- The list linear arboricity of graphs (Q6056776) (← links)
- Partitioning edges of a planar graph into linear forests and a matching (Q6081582) (← links)
- Linear arboricity of degenerate graphs (Q6094033) (← 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)