Pages that link to "Item:Q1701100"
From MaRDI portal
The following pages link to Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring (Q1701100):
Displaying 16 items.
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- Neighbor sum distinguishing total chromatic number of 2-degenerate graphs (Q1627882) (← links)
- Neighbor sum distinguishing list total coloring of subcubic graphs (Q1743484) (← links)
- 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)
- 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 choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
- Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
- Neighbor product distinguishing total colorings of 2-degenerate graphs (Q2292128) (← links)
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
- On neighbour-distinguishing colourings from lists (Q3439452) (← links)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← 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)
