Pages that link to "Item:Q897872"

The following pages link to On the neighbor sum distinguishing total coloring of planar graphs (Q897872):

Displaying 10 items.

• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles (Q501651) (← links)
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs (Q1627882) (← 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)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)