The following pages link to Algorithms – ESA 2004 (Q5464602):
Displaying 14 items.
- From the plane to higher surfaces (Q444375) (← links)
- Adjacency queries in dynamic sparse graphs (Q846004) (← links)
- Many 3-colorings of triangle-free planar graphs (Q875936) (← links)
- Fractional coloring of triangle-free planar graphs (Q888619) (← links)
- 3-dynamic coloring of planar triangulations (Q1783610) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- Efficient reassembling of three-regular planar graphs (Q2175057) (← 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)
- Sub-exponentially many 3-colorings of triangle-free planar graphs (Q2851443) (← links)
- Three-coloring triangle-free planar graphs in linear time (Q3189025) (← links)
- Triangulating Three-Colored Graphs in Linear Time and Linear Space (Q4695390) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
