Pages that link to "Item:Q1045187"

The following pages link to 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) (Q1045187):

Displaying 31 items.

• An improved bound on 2-distance coloring plane graphs with girth 5 (Q306114) (← links)
• Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
• 2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716) (← links)
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
• Injective choosability of planar graphs of girth five and six (Q409477) (← links)
• An introduction to the discharging method via graph coloring (Q507506) (← links)
• On 2-distance coloring of plane graphs with girth 5 (Q516880) (← links)
• Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 (Q536624) (← links)
• List injective colorings of planar graphs (Q615993) (← links)
• List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
• Injective colorings of sparse graphs (Q710598) (← links)
• List injective coloring of planar graphs with girth \(g \geq 6\) (Q738861) (← links)
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
• List 2-distance coloring of planar graphs (Q887861) (← links)
• Coloring the square of graphs whose maximum average degree is less than 4 (Q906469) (← links)
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
• 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
• 2-distance colorings of integer distance graphs (Q1717215) (← links)
• An optimal square coloring of planar graphs (Q1928491) (← links)
• Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
• Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
• Bounding the chromatic number of squares of \(K_4\)-minor-free graphs (Q2421854) (← 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)
• A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 (Q4577850) (← links)
• List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles (Q4978441) (← links)
• 2-Distance coloring of planar graph (Q5012803) (← links)
• 2-distance choice number of planar graphs with maximal degree no more than 4 (Q5025121) (← links)
• 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles (Q5232154) (← links)
• The list 2-distance coloring of a graph with Δ(G) = 5 (Q5261051) (← links)
• 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles (Q6174168) (← links)