Pages that link to "Item:Q3189025"
From MaRDI portal
The following pages link to Three-coloring triangle-free planar graphs in linear time (Q3189025):
Displaying 18 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Many 3-colorings of triangle-free planar graphs (Q875936) (← links)
- Fractional coloring of triangle-free planar graphs (Q888619) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
- Do triangle-free planar graphs have exponentially many 3-colorings? (Q2401433) (← links)
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm (Q2664564) (← links)
- Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings (Q2673487) (← links)
- Triangulating Three-Colored Graphs in Linear Time and Linear Space (Q4695390) (← links)
- Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time (Q5236218) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Algorithms – ESA 2004 (Q5464602) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ (Q6081578) (← links)
