Pages that link to "Item:Q2099419"

The following pages link to Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles (Q2099419):

Displaying 6 items.

• The number of colorings of planar graphs with no separating triangles (Q345111) (← links)
• Three-coloring planar graphs without short cycles (Q845915) (← links)
• Many 3-colorings of triangle-free planar graphs (Q875936) (← 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)