Pages that link to "Item:Q306111"

The following pages link to A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111):

Displaying 4 items.

• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
• Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 (Q6178525) (← links)