Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs

From MaRDI portal
Publication:427574












This page was built for publication: Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs

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