Pages that link to "Item:Q1356680"

The following pages link to On the linear \(k\)-arboricity of cubic graphs (Q1356680):

Displaying 19 items.

• An improved upper bound on the linear 2-arboricity of planar graphs (Q501025) (← links)
• A note on the linear 2-arboricity of planar graphs (Q526220) (← links)
• On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) (Q608262) (← links)
• Relaxed two-coloring of cubic graphs (Q885301) (← links)
• The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) (Q932632) (← links)
• Planar graphs without 5-cycles or without 6-cycles (Q1025913) (← links)
• Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5 (Q1306426) (← links)
• Bounded size components -- partitions and transversals. (Q1400964) (← links)
• Factorisation of regular graphs into forests of short paths (Q1584284) (← links)
• Isomorphic bisections of cubic graphs (Q1984530) (← links)
• The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\) (Q2248715) (← links)
• The linear \((n - 1)\)-arboricity of some lexicographic product graphs (Q2335741) (← links)
• Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles (Q2376098) (← links)
• THE LINEAR 6-ARBORICITY OF THE COMPLETE BIPARTITE GRAPH K_m,n (Q2874040) (← links)
• Graph coloring with no large monochromatic components (Q3503460) (← links)
• On the linear<i>K</i>-arboricity of cubic graphs (Q4521950) (← links)
• On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles (Q4976301) (← links)
• The linear 2-arboricity of sparse graphs (Q5370820) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)