Pages that link to "Item:Q5962524"
From MaRDI portal
The following pages link to Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524):
Displaying 11 items.
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree (Q2292151) (← links)
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
- Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
- A note on the neighbor sum distinguishing total coloring of planar graphs (Q2629242) (← links)
- Constructing integer-magic graphs via the Combinatorial Nullstellensatz (Q5045258) (← links)
