Pages that link to "Item:Q2282486"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486):
Displaying 7 items.
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs (Q1987570) (← links)
- On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs (Q2185920) (← links)
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← 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)
