Pages that link to "Item:Q5905418"
From MaRDI portal
The following pages link to Acyclic colorings of planar graphs (Q5905418):
Displaying 24 items.
- Reprint of: ``Grid representations and the chromatic number'' (Q390168) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Vertex-arboricity of planar graphs without intersecting triangles (Q412284) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- The vertex linear arboricity of distance graphs (Q819822) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Facial incidence colorings of embedded multigraphs (Q1630925) (← links)
- On \(S\)-packing edge-colorings of cubic graphs (Q1735677) (← links)
- Parallel complexity of partitioning a planar graph into vertex-induced forests (Q1923610) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- Proper coloring of geometric hypergraphs (Q2324632) (← links)
- Grid representations and the chromatic number (Q2391545) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles (Q2815462) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- On vertex partitions and some minor-monotone graph parameters (Q3067061) (← links)
- On Vertex Partitions and the Colin de Verdière Parameter (Q3439630) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- Path partition of planar graphs with girth at least six (Q6059078) (← links)
