Pages that link to "Item:Q867795"

The following pages link to \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795):

Displaying 8 items.

• Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
• On \(d_2\)-coloring of certain families of graphs (Q2091583) (← links)
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) (Q2170502) (← links)
• \(d\)-strong total colorings of graphs (Q2346331) (← links)
• Distant set distinguishing total colourings of graphs (Q2629496) (← links)
• \(D(\beta)\)-vertex-distinguishing proper total coloring of the generalized Mycielski graph \(M_n(P^3_m)\) (Q2860272) (← links)
• A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data (Q2885693) (← links)
• (Q5294976) (← links)