Pages that link to "Item:Q2498403"
From MaRDI portal
The following pages link to Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult (Q2498403):
Displaying 9 items.
- WORM colorings of planar graphs (Q521753) (← links)
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
- Planar Ramsey graphs (Q2327223) (← 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)
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
