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

• An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) (← links)
• Concise proofs for adjacent vertex-distinguishing total colorings (Q1025519) (← links)
• Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
• A note on the adjacent vertex distinguishing total chromatic number of graphs (Q1759396) (← 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)
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← links)
• On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs (Q2859640) (← links)
• A bound of the vertex-distinguishing total chromatic number of graphs (Q2886306) (← links)
• Adjacent-vertex-distinguishing total coloring of indifference graphs (Q2918479) (← links)
• An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs (Q2926811) (← links)
• (Q3072236) (← links)
• (Q3572447) (← links)
• (Q5194469) (← links)