Pages that link to "Item:Q277657"

The following pages link to Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657):

Displaying 3 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)
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)