Pages that link to "Item:Q5632602"

The following pages link to COVERING AND PACKING IN GRAPHS, I. (Q5632602):

Displaying 50 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 intermediate value theorem for the arboricities (Q554848) (← links)
• On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) (Q608262) (← links)
• On linear k-arboricity (Q761470) (← links)
• NP-completeness of some problems of partitioning and covering in graphs (Q794673) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Induced-path partition on graphs with special blocks (Q868947) (← links)
• Three ways to cover a graph (Q898135) (← links)
• The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
• Minimum partition of an independence system into independent sets (Q1013303) (← 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)
• Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
• A sequential coloring algorithm for finite sets (Q1297462) (← links)
• Parallel concepts in graph theory (Q1324287) (← links)
• Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
• On the linear \(k\)-arboricity of cubic graphs (Q1356680) (← links)
• Linear \(k\)-arboricities on trees (Q1570841) (← links)
• Interpolation theorems for graphs, hypergraphs and matroids (Q1584241) (← links)
• Factorisation of regular graphs into forests of short paths (Q1584284) (← links)
• Acyclic graphoidal covers and path partitions in a graph (Q1584403) (← links)
• On monochromatic component size for improper colourings (Q1775062) (← links)
• Path covering problems and testing of printed circuits (Q1900134) (← links)
• Towards the linear arboricity conjecture (Q1985445) (← links)
• Linear arboricity of outer-1-planar graphs (Q2033994) (← links)
• Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree (Q2071534) (← links)
• The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
• Edge coloring of signed graphs (Q2185748) (← links)
• The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\) (Q2248715) (← links)
• Induced graphoidal decompositions in product graphs (Q2249943) (← links)
• Induced label graphoidal graphs (Q2254542) (← links)
• The list linear arboricity of planar graphs with 7-cycles containing at most two chords (Q2286100) (← links)
• The linear arboricity of planar graphs without 5-, 6-cycles with chords (Q2376109) (← links)
• An algorithm to cyclic path covering number (Q2839230) (← links)
• The linear 6-arboricity of the complete bipartite graph \(K_{m,n}\) (Q2874040) (← links)
• A planar linear arboricity conjecture (Q2891050) (← links)
• Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
• (Q3037472) (← links)
• LIST POINT ARBORICITY OF GRAPHS (Q3166733) (← links)
• New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph (Q3296849) (← links)
• Uq(sln) web models and Zn spin interfaces (Q3382345) (← links)
• The linear arboricity of planar graphs of maximum degree seven is four (Q3522847) (← links)
• The linear arboricity of some regular graphs (Q3703914) (← links)
• (Q3752419) (← links)
• Linear arboricity of digraphs (Q3794200) (← links)
• Some results on linear arboricity (Q3795688) (← links)
• (Q3907606) (← links)