Pages that link to "Item:Q3005110"

The following pages link to List strong linear 2-arboricity of sparse graphs (Q3005110):

Displaying 12 items.

• On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
• Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
• Path choosability of planar graphs (Q1627209) (← links)
• Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
• Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
• Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
• Vertex Partitions of Graphs into Cographs and Stars (Q2874091) (← links)
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
• Defective and clustered choosability of sparse graphs (Q5222556) (← links)
• Partition of a planar graph with girth 6 into two forests with chain length at most 4 (Q5264731) (← links)
• (Q5878782) (← links)
• Path partition of planar graphs with girth at least six (Q6059078) (← links)