Pages that link to "Item:Q875936"

The following pages link to Many 3-colorings of triangle-free planar graphs (Q875936):

Displaying 17 items.

• What is on his mind? (Q709300) (← links)
• Exponentially many 5-list-colorings of planar graphs (Q885292) (← links)
• Graphs with full rank 3-color matrix and few 3-colorings (Q947734) (← links)
• The chromatic polynomial and list colorings (Q1003851) (← links)
• Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs (Q2037549) (← links)
• Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
• Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles (Q2099419) (← links)
• 3-list-coloring graphs of girth at least five on surfaces (Q2222041) (← links)
• Do triangle-free planar graphs have exponentially many 3-colorings? (Q2401433) (← 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)
• Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
• A General Framework for Hypergraph Coloring (Q5093586) (← links)
• Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles (Q5346562) (← links)
• Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows (Q5915811) (← links)
• An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)
• Counting circuit double covers (Q6657602) (← links)