On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs
From MaRDI portal
Publication:2859640
Recommendations
- An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs
- scientific article; zbMATH DE number 5847230
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
- scientific article; zbMATH DE number 5732458
Cited in
(13)- An upper bound of the adjacent-vertex-strong-distinguishing total chromatic number of graphs
- An upper bound on the vertex-distinguishing IE-total chromatic number of graphs
- scientific article; zbMATH DE number 6532237 (Why is no real title available?)
- scientific article; zbMATH DE number 7108817 (Why is no real title available?)
- scientific article; zbMATH DE number 5732458 (Why is no real title available?)
- Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
- scientific article; zbMATH DE number 7070753 (Why is no real title available?)
- A bound of the vertex-distinguishing total chromatic number of graphs
- scientific article; zbMATH DE number 5847230 (Why is no real title available?)
- scientific article; zbMATH DE number 2185526 (Why is no real title available?)
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
- Asymptotic behavior of the adjacent vertex distinguishing total coloring of graphs
- The bound of the vertex-distinguishing total chromatic number of regular graphs
This page was built for publication: On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859640)