A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
From MaRDI portal
(Redirected from Publication:730490)
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 )