The following pages link to (Q3072236):
Displaying 6 items.
- Distinguishing graphs by total colourings (Q2835392) (← links)
- On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs (Q2859640) (← links)
- Not necessarily proper total colourings which are adjacent vertex distinguishing (Q2874310) (← links)
- An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs (Q2926811) (← links)
- The bound of the vertex-distinguishing total chromatic number of regular graphs (Q3180372) (← links)
- (Q3572447) (← links)