Pages that link to "Item:Q2811835"

The following pages link to Neighbor sums distinguishing total colorings of planar graphs without short cycles (Q2811835):

Displaying 10 items.

• On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← links)
• Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) (Q2352779) (← links)
• A note on the neighbor sum distinguishing total coloring of planar graphs (Q2629242) (← links)
• Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles (Q5071596) (← links)
• Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles (Q6657249) (← links)
• Neighbor product distinguishing total coloring of planar graphs without 5-cycles (Q6661065) (← links)