Pages that link to "Item:Q1682215"

The following pages link to The square of a planar cubic graph is 7-colorable (Q1682215):

Displaying 32 items.

• Decomposition of cubic graphs related to Wegner's conjecture (Q1732787) (← links)
• An optimal square coloring of planar graphs (Q1928491) (← links)
• Coloring squares of graphs with mad constraints (Q2009007) (← links)
• The complexity of frugal colouring (Q2023759) (← links)
• Counterexamples to Thomassen's conjecture on decomposition of cubic graphs (Q2053720) (← links)
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs (Q2084788) (← links)
• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← 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)
• Connectivity of minimum non-5-injectively colorable planar cubic graphs (Q2176826) (← links)
• A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) (Q2225423) (← links)
• Bounding the chromatic number of squares of \(K_4\)-minor-free graphs (Q2421854) (← links)
• Exact square coloring of subcubic planar graphs (Q2659166) (← links)
• Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen (Q2685314) (← 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)
• List-coloring the square of a subcubic graph (Q3539931) (← links)
• 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles (Q5232154) (← links)
• Coloring squares of graphs via vertex orderings (Q5859506) (← links)
• 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 (Q6041534) (← links)
• Coloring the square of maximal Planar graphs with diameter two (Q6048644) (← links)
• Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
• 2-distance coloring of planar graphs without adjacent 5-cycles (Q6166190) (← links)
• A note on 3-distance coloring of planar graphs (Q6563283) (← links)
• Some results on 2-distance coloring of planar graphs with girth five (Q6571280) (← 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)
• 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method (Q6635121) (← links)
• Cliques in squares of graphs with maximum average degree less than 4 (Q6642507) (← links)
• The 2-distance chromatic number of planar graphs without 3,4,8-cycles (Q6645214) (← links)
• An improved bound for 2-distance coloring of planar graphs with girth six (Q6657227) (← links)