Pages that link to "Item:Q4248536"

The following pages link to On the linear arboricity of planar graphs (Q4248536):

Displaying 39 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)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Three ways to cover a graph (Q898135) (← links)
• The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
• On point-linear arboricity of planar graphs (Q1115876) (← 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)
• On linear 2-arboricity of certain graphs (Q2101974) (← links)
• Edge coloring of signed graphs (Q2185748) (← links)
• A structural theorem for planar graphs with some applications (Q2275921) (← 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)
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← 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)
• 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)
• The linear 6-arboricity of the complete bipartite graph \(K_{m,n}\) (Q2874040) (← links)
• A planar linear arboricity conjecture (Q2891050) (← links)
• On the linear vertex-arboricity of a planar graph (Q3484846) (← links)
• The linear arboricity of planar graphs of maximum degree seven is four (Q3522847) (← links)
• Some results on linear arboricity (Q3795688) (← links)
• (Q5129361) (← links)
• The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic (Q5189498) (← links)
• (Q5196777) (← links)
• The list linear arboricity of graphs (Q6056776) (← links)
• Partitioning edges of a planar graph into linear forests and a matching (Q6081582) (← links)
• Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← 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)