Pages that link to "Item:Q412284"
From MaRDI portal
The following pages link to Vertex-arboricity of planar graphs without intersecting triangles (Q412284):
Displaying 27 items.
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles (Q294558) (← links)
- Vertex arboricity of toroidal graphs with a forbidden cycle (Q400411) (← links)
- List total arboricity of 2-degenerate graphs (Q714512) (← links)
- Vertex arboricity of planar graphs without intersecting 5-cycles (Q1702820) (← links)
- A note on the list vertex arboricity of toroidal graphs (Q1800404) (← links)
- List vertex-arboricity of planar graphs without intersecting 5-cycles (Q1987594) (← links)
- A structural property of trees with an application to vertex-arboricity (Q1992728) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles (Q2074364) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
- Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles (Q2193274) (← links)
- On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
- List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles (Q2671036) (← links)
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic (Q5859490) (← links)
- An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
- On odd colorings of planar graphs (Q6080172) (← links)
- Partitioning kite‐free planar graphs into two forests (Q6201024) (← links)
- A note on the list vertex-arboricity of IC-planar graphs (Q6542022) (← links)
- Partitioning planar graph of girth 5 into two forests with maximum degree 4. (Q6584423) (← links)
- Partitioning a planar graph without chordal 5-cycles into two forests. (Q6584425) (← links)
- Partitioning planar graphs into bounded degree forests (Q6585546) (← links)
- The vertex arboricity of 1-planar graphs (Q6616434) (← links)
