Pages that link to "Item:Q2219970"

The following pages link to Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970):

Displaying 9 items.

• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502) (← links)
• \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 (Q3179898) (← links)
• (Q5033142) (← links)
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848) (← links)
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (Q6657249) (← links)