Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs

From MaRDI portal

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.