Pages that link to "Item:Q724731"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731):
Displaying 6 items.
- Neighbor sum distinguishing total choice number of planar graphs without 6-cycles (Q1995610) (← links)
- Neighbor sum distinguishing total choosability of cubic graphs (Q2227993) (← links)
- Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
- List edge-coloring and total coloring in graphs of low treewidth (Q2800543) (← links)
- Asymptotically optimal neighbour sum distinguishing colourings of graphs (Q3460519) (← links)
- Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)