On computing the minimum 3-path vertex cover and dissociation number of graphs

From MaRDI portal

(Redirected from Publication:650941)

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_computing_the_minimum_3-path_vertex_cover_and_dissociation_number_of_graphs&oldid=63320373"