Pages that link to "Item:Q2664564"

The following pages link to Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm (Q2664564):

Displaying 16 items.

• 3-colouring AT-free graphs in polynomial time (Q1934316) (← 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)
• Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
• Characterization of 4-critical triangle-free toroidal graphs (Q2668022) (← links)
• A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs (Q3141527) (← links)
• Three-coloring triangle-free planar graphs in linear time (Q3189025) (← links)
• Triangulating Three-Colored Graphs in Linear Time and Linear Space (Q4695390) (← links)
• (Q5206906) (← links)
• Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
• Coloring Triangle-Free Graphs on Surfaces (Q5387740) (← links)
• Algorithms – ESA 2004 (Q5464602) (← links)
• Flexibility of triangle‐free planar graphs (Q6055413) (← links)
• Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations (Q6184892) (← links)