Pages that link to "Item:Q2185920"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total coloring of IC-planar graphs (Q2185920):
Displaying 10 items.
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs (Q1987570) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
- Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
- A note on the neighbor sum distinguishing total coloring of planar graphs (Q2629242) (← 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)