Pages that link to "Item:Q501651"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651):
Displaying 12 items.
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles (Q2181224) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
- Neighbor sum distinguishing index of sparse graphs (Q2194737) (← links)
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
- Neighbor sum distinguishing total choosability of cubic graphs (Q2227993) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
- Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions (Q5035848) (← links)
- Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles (Q5071596) (← 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)
- Neighbor product distinguishing total coloring of planar graphs without 5-cycles (Q6661065) (← links)
