Pages that link to "Item:Q3503513"

The following pages link to List Colouring Squares of Planar Graphs (Q3503513):

Displaying 37 items.

• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
• Distributed colorings for collision-free routing in sink-centric sensor networks (Q450566) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• Coloring the square of Sierpiński graphs (Q497382) (← links)
• An introduction to the discharging method via graph coloring (Q507506) (← links)
• \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
• Cyclic colorings of plane graphs with independent faces (Q661937) (← links)
• Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
• Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
• The distance coloring of graphs (Q741239) (← links)
• Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
• The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes (Q765320) (← links)
• Facial colorings using Hall's theorem (Q966152) (← links)
• List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six (Q1024323) (← links)
• A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs (Q1045198) (← links)
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles (Q1631690) (← links)
• On list \(r\)-hued coloring of planar graphs (Q1680495) (← links)
• The complexity of frugal colouring (Q2023759) (← links)
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs (Q2084788) (← links)
• Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
• 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 (Q2165285) (← links)
• Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
• A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
• Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
• Exact square coloring of subcubic planar graphs (Q2659166) (← links)
• Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
• Improved square coloring of planar graphs (Q2685324) (← links)
• Third Case of the Cyclic Coloring Conjecture (Q2797092) (← links)
• List 2-distance coloring of planar graphs without short cycles (Q2798330) (← links)
• Coloring plane graphs with independent crossings (Q3055915) (← links)
• List Colouring Squares of Planar Graphs (Q3503513) (← links)
• List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles (Q4978441) (← links)
• Angular Resolutions: Around Vertices and Crossings (Q5001662) (← links)
• 2-distance choice number of planar graphs with maximal degree no more than 4 (Q5025121) (← links)
• Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
• 2-distance coloring of planar graphs without adjacent 5-cycles (Q6166190) (← links)