Pages that link to "Item:Q2824258"

The following pages link to New upper bound on the chromatic number of the square of a planar graph (Q2824258):

Displaying 9 items.

• Coloring squares of planar graphs with girth six (Q2427536) (← links)
• Chromatic number of square of maximal outerplanar graphs (Q2466444) (← links)
• A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
• Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
• Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
• Choosability of the square of a planar graph with maximum degree four (Q2876030) (← links)
• Vertex coloring the square of outerplanar graphs of low degree (Q2997588) (← links)
• Upper bound on chromatic number of square graph of sparse graphs (Q3385887) (← links)
• On the structural result on normal plane maps (Q4435565) (← links)