Pages that link to "Item:Q3180372"
From MaRDI portal
The following pages link to The bound of the vertex-distinguishing total chromatic number of regular graphs (Q3180372):
Displaying 3 items.
- The \(b\)-chromatic number and \(f\)-chromatic vertex number of regular graphs (Q477335) (← 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)