On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs

From MaRDI portal

(Redirected from On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs)

Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_the_algorithmic_complexity_of_adjacent_vertex_closed_distinguishing_colorings_number_of_graphs&oldid=63899958"