Pages that link to "Item:Q1706133"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133):
Displayed 10 items.
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs (Q1987570) (← links)
- Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610) (← links)
- Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
- Neighbor sum distinguishing total colorings of corona of subcubic graphs (Q2045233) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← 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 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 total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)