Pages that link to "Item:Q2828964"

The following pages link to Neighbor sum distinguishing total choosability of graphs with larger maximum average degree. (Q2828964):

Displaying 9 items.

• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
• Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
• On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272) (← links)
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (Q2452418) (← links)
• Neighbor sum distinguishing total coloring of a kind of sparse graph. (Q2829032) (← links)
• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 (Q3179898) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (Q6657249) (← links)
• Neighbor product distinguishing total coloring of planar graphs without 5-cycles (Q6661065) (← links)