Pages that link to "Item:Q324868"

The following pages link to Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868):

Displaying 11 items.

• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
• Cycle adjacency of planar graphs and 3-colourability (Q647258) (← links)
• Three-coloring planar graphs without short cycles (Q845915) (← links)
• A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
• A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles (Q2092419) (← links)
• New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) (← 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)
• Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles (Q2857451) (← links)
• 3-Coloring graphs embedded in surfaces (Q4948508) (← links)