Pages that link to "Item:Q1995610"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610):
Displaying 5 items.
- (Q5033142) (← 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 coloring of planar graphs with restrained cycles (Q6637047) (← links)
- Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (Q6657249) (← links)