Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
From MaRDI portal
(Redirected from Publication:834895)
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 )