Pages that link to "Item:Q2804813"
From MaRDI portal
The following pages link to Upper bounds on the \(D(\beta)\)-vertex-distinguishing total-chromatic number of graphs. (Q2804813):
Displaying 3 items.
- An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs (Q2858198) (← links)
- A bound on vertex distinguishing total coloring of graphs with distance constraint for recurrent event data (Q2885693) (← links)
- A bound of the vertex-distinguishing total chromatic number of graphs (Q2886306) (← links)