Pages that link to "Item:Q2857451"

The following pages link to Three coloring planar graphs without cycles of length from 4 to 6 or seven cycles with close triangles (Q2857451):

Displaying 8 items.

• Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable (Q932660) (← links)
• Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
• Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← 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)
• Planar graphs without 4, 6, 8-cycles are 3-colorable (Q2475310) (← links)
• Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings (Q2673487) (← links)
• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)