The following pages link to (Q3572447):
Displaying 12 items.
- The adjacent vertex distinguishing total chromatic number (Q442409) (← links)
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550) (← links)
- On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs (Q1750669) (← links)
- A note on the adjacent vertex distinguishing total chromatic number of graphs (Q1759396) (← links)
- \(d\)-strong total colorings of graphs (Q2346331) (← links)
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247) (← links)
- On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs (Q2859640) (← 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)
- (Q3072236) (← links)
- (Q3461693) (← links)
- (Q5194469) (← links)
