Pages that link to "Item:Q3179898"

The following pages link to \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 (Q3179898):

Displaying 2 items.

• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)