Pages that link to "Item:Q3484846"

The following pages link to On the linear vertex-arboricity of a planar graph (Q3484846):

Displaying 50 items.

• Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
• Vertex-arboricity of planar graphs without intersecting triangles (Q412284) (← links)
• On the vertex-arboricity of planar graphs without 7-cycles (Q442319) (← links)
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs (Q444448) (← links)
• The linear arboricity of planar graphs with maximum degree at least 5 (Q456114) (← links)
• WORM colorings of planar graphs (Q521753) (← links)
• On linear k-arboricity (Q761470) (← links)
• The vertex linear arboricity of distance graphs (Q819822) (← links)
• On point-linear arboricity of planar graphs (Q1115876) (← links)
• On the relations between arboricity and independent number or covering number (Q1270790) (← links)
• Path choosability of planar graphs (Q1627209) (← links)
• Facial incidence colorings of embedded multigraphs (Q1630925) (← links)
• A lower bound on the order of the largest induced linear forest in triangle-free planar graphs (Q1727766) (← links)
• On \(S\)-packing edge-colorings of cubic graphs (Q1735677) (← links)
• On the minimal reducible bound for outerplanar and planar graphs (Q1916137) (← links)
• Parallel complexity of partitioning a planar graph into vertex-induced forests (Q1923610) (← links)
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
• A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
• Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← 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)
• Monochromatic subgraphs in iterated triangulations (Q2209888) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
• On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
• Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
• Proper coloring of geometric hypergraphs (Q2324632) (← links)
• Planar Ramsey graphs (Q2327223) (← links)
• Equitable partition of graphs into induced forests (Q2342637) (← links)
• On the vertex arboricity of planar graphs of diameter two (Q2384426) (← links)
• On the vertex-arboricity of planar graphs (Q2427551) (← links)
• Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
• Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
• SEFE without mapping via large induced outerplane graphs in plane graphs (Q2811194) (← links)
• Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
• List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
• On vertex partitions and some minor-monotone graph parameters (Q3067061) (← links)
• On Vertex Partitions and the Colin de Verdière Parameter (Q3439630) (← links)
• Bounds for the vertex linear arboricity (Q3484848) (← links)
• On the linear arboricity of planar graphs (Q4248536) (← links)
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
• (Q5129361) (← links)
• An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
• The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic (Q5189498) (← links)
• (Q5878782) (← links)
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
• An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
• Path partition of planar graphs with girth at least six (Q6059078) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)