Pages that link to "Item:Q287913"
From MaRDI portal
The following pages link to Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913):
Displaying 3 items.
- Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610) (← links)
- Neighbor sum distinguishing total choosability of cubic graphs (Q2227993) (← links)
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)
