Pages that link to "Item:Q681756"

The following pages link to Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) (Q681756):

Displaying 12 items.

• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
• An improved upper bound for the neighbor sum distinguishing index of graphs (Q401154) (← links)
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree (Q726516) (← links)
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (Q1709430) (← links)
• On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (Q2452418) (← links)
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
• The neighbour sum distinguishing relaxed edge colouring (Q2668336) (← links)
• Neighbor sum distinguishing total choosability of graphs with larger maximum average degree. (Q2828964) (← links)
• (Q5206402) (← links)
• Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph (Q6046133) (← links)