Pages that link to "Item:Q724734"

The following pages link to Minimum 2-distance coloring of planar graphs and channel assignment (Q724734):

Displaying 14 items.

• \(2\)-distance coloring of planar graphs with maximum degree \(5\) (Q2075520) (← links)
• The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles (Q2111526) (← links)
• Wegner's conjecture on 2-distance coloring (Q2151384) (← links)
• Wegner's conjecture on 2-distance coloring for planar graphs (Q2152439) (← links)
• Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
• Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
• Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825) (← links)
• Improved square coloring of planar graphs (Q2685324) (← links)
• Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
• 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
• (Q4865135) (← links)
• 2-distance choice number of planar graphs with maximal degree no more than 4 (Q5025121) (← links)
• Relaxation of Wegner's planar graph conjecture for maximum degree 4 (Q6611072) (← links)
• Improved 2-distance coloring of planar graphs with maximum degree 5 (Q6635091) (← links)