Pages that link to "Item:Q2181224"

The following pages link to Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles (Q2181224):

Displaying 10 items.

• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610) (← links)
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502) (← links)
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 (Q3179898) (← links)
• (Q5033142) (← links)
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848) (← links)