Pages that link to "Item:Q2409525"

The following pages link to Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525):

Displaying 11 items.

• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
• On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs (Q1627882) (← links)
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)