Algorithms for generalized stability numbers of tree graphs

DOI10.1017/S1446788700004031MaRDI QIDQ5508789zbMATH OpenOpenAlexFDO

Authors C. P. Ng, David E. Daykin

Publication date 1966

Published in Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s1446788700004031

zbMATH Keywords

topology

Cited in

(3)

• On the algorithmic complexity of twelve covering and independence parameters of graphs
• Extensions of the Minimum Dominating Set Problem
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: Algorithms for generalized stability numbers of tree graphs

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