Pages that link to "Item:Q1709550"

The following pages link to An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550):

Displaying 4 items.

• Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
• Strict neighbor-distinguishing total index of graphs (Q2131155) (← links)
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502) (← links)
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)