Pages that link to "Item:Q3936755"

The following pages link to Covering and packing in graphs IV: Linear arboricity (Q3936755):

Displaying 47 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)
• Inapproximability of maximal strip recovery (Q551208) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• On graph thickness, geometric thickness, and separator theorems (Q621923) (← 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)
• Finding occurrences of protein complexes in protein-protein interaction graphs (Q1013075) (← links)
• Covering and packing in graphs. V. Mispacking subcubes in hypercubes (Q1102983) (← links)
• The linear arboricity of graphs (Q1120581) (← links)
• Some problems about linear arboricity (Q1164649) (← links)
• Partitioning regular graphs into equicardinal linear forests (Q1174174) (← links)
• A note on the arboricity of graphs (Q1205341) (← links)
• Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
• Linear \(k\)-arboricities on trees (Q1570841) (← links)
• The star arboricity of graphs (Q1825208) (← links)
• Partitioning circulant graphs into isomorphic linear forests (Q1864211) (← links)
• Path covering problems and testing of printed circuits (Q1900134) (← links)
• Towards the linear arboricity conjecture (Q1985445) (← links)
• Linear arboricity of regular digraphs (Q2013125) (← links)
• The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
• The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
• The list linear arboricity of planar graphs with 7-cycles containing at most two chords (Q2286100) (← links)
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) (Q2373936) (← links)
• The linear arboricity of planar graphs without 5-, 6-cycles with chords (Q2376109) (← links)
• The \(k\)-strong induced arboricity of a graph (Q2408964) (← 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)
• LIST POINT ARBORICITY OF GRAPHS (Q3166733) (← links)
• (Q3752419) (← links)
• (Q3815343) (← links)
• Note on linear arboricity of graphs with large girth (Q4005688) (← links)
• (Q4018734) (← links)
• (Q4291534) (← links)
• Almost Every Graph can be Covered by Linear Forests (Q4862746) (← links)
• The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
• Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs (Q6041575) (← 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)
• 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)