Pages that link to "Item:Q2227993"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total choosability of cubic graphs (Q2227993):
Displaying 7 items.
- List neighbor sum distinguishing edge coloring of subcubic graphs (Q1686014) (← links)
- Neighbor sum distinguishing list total coloring of subcubic graphs (Q1743484) (← links)
- \mbox{\boldmath $\Delta=3$} 的图的邻和可区别全可选性 (Q3179898) (← links)
- (Q3193659) (← links)
- Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848) (← 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)