Pages that link to "Item:Q2227993"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total choosability of cubic graphs (Q2227993):
Displaying 3 items.
- 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)