An upper bound for the 3-tone chromatic number of graphs with maximum degree 3

From MaRDI portal
Publication:2676763















This page was built for publication: An upper bound for the 3-tone chromatic number of graphs with maximum degree 3

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676763)