Pages that link to "Item:Q1045158"

The following pages link to Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158):

Displaying 17 items.

• Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
• A toughness condition for a spanning tree with bounded total excesses (Q497366) (← links)
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
• Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
• On 3-colorability of planar graphs without adjacent short cycles (Q977289) (← links)
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
• Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673) (← links)
• A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
• Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
• Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
• Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
• Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
• Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (Q2371269) (← links)
• Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
• Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings (Q4865526) (← links)
• (Q5277036) (← links)