The kernelization complexity of connected domination in graphs with (no) small cycles
From MaRDI portal
Publication:476436
DOI10.1007/S00453-012-9681-ZzbMATH Open1318.68096OpenAlexW2083586074MaRDI QIDQ476436
Author name not available (Why is that?)
Publication date: 2 December 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9681-z
No records found.
No records found.
This page was built for publication: The kernelization complexity of connected domination in graphs with (no) small cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476436)
