Pages that link to "Item:Q2859640"
From MaRDI portal
The following pages link to On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs (Q2859640):
Displaying 11 items.
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550) (← links)
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← links)
- A bound of the vertex-distinguishing total chromatic number of graphs (Q2886306) (← links)
- An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs (Q2926811) (← links)
- (Q3024679) (← links)
- (Q3072236) (← links)
- The bound of the vertex-distinguishing total chromatic number of regular graphs (Q3180372) (← links)
- (Q3461693) (← links)
- (Q3572447) (← links)
- (Q5194469) (← links)
- (Q5383624) (← links)