Pages that link to "Item:Q1957652"

The following pages link to Fast 3-coloring triangle-free planar graphs (Q1957652):

Displaying 14 items.

• 3-dynamic coloring of planar triangulations (Q1783610) (← links)
• Greedy algorithms for triangle free coloring (Q1927697) (← 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)
• 3-colorability of pseudo-triangulations (Q2792798) (← links)
• Vertex-Coloring with Star-Defects (Q2803807) (← links)
• Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (Q2942621) (← links)
• Three-coloring triangle-free planar graphs in linear time (Q3189025) (← links)
• On the complexity for constructing a 3-colouring for planar graphs with short facets (Q5213298) (← links)
• Algorithms – ESA 2004 (Q5464602) (← links)
• (Q5743426) (← links)
• Backbone coloring of graphs with galaxy backbones (Q5918665) (← links)