Pages that link to "Item:Q511730"

The following pages link to The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730):

Displaying 2 items.

• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
• Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten (Q2042610) (← links)