Pages that link to "Item:Q5495675"
From MaRDI portal
The following pages link to Colouring Planar Graphs With Three Colours and No Large Monochromatic Components (Q5495675):
Displaying 13 items.
- WORM colorings of planar graphs (Q521753) (← links)
- On fractional fragility rates of graph classes (Q2205120) (← links)
- Proper coloring of geometric hypergraphs (Q2324632) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
- Islands in Graphs on Surfaces (Q5743553) (← links)
- Clustered colouring of graph classes with bounded treedepth or pathwidth (Q5885188) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5890901) (← links)
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) (← links)
