Pages that link to "Item:Q2410247"
From MaRDI portal
The following pages link to Upper bounds on adjacent vertex distinguishing total chromatic number of graphs (Q2410247):
Displaying 20 items.
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs (Q294532) (← links)
- Upper bounds on vertex distinguishing chromatic indices of some Halin graphs (Q377916) (← links)
- Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph (Q508738) (← links)
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) (Q932658) (← links)
- Concise proofs for adjacent vertex-distinguishing total colorings (Q1025519) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550) (← links)
- A note on the adjacent vertex distinguishing total chromatic number of graphs (Q1759396) (← links)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\) (Q2460105) (← 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)
- Adjacent vertex distinguishing total colorings of graphs with smaller degrees (Q2923824) (← links)
- An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs (Q2926811) (← links)
- (Q3024679) (← links)
- (Q3072236) (← links)
- (Q3384719) (← links)
- (Q3572447) (← links)
- (Q4604121) (← links)
- (Q5194469) (← links)
- (Q5383624) (← links)
