On an upper bound for adjacent vertex-distinguishing total chromatic numbers of graphs

From MaRDI portal
Publication:2859640












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)