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 7 items.

• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
• 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)
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) (Q2410091) (← links)
• The adjacent vertex distinguishing total coloring of planar graphs (Q2444142) (← links)
• Adjacent-vertex-distinguishing total coloring of planar bipartite graphs (Q2886280) (← links)