Computing a minimum paired-dominating set in strongly orderable graphs

From MaRDI portal
Revision as of 03:45, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1634760

DOI10.1016/J.DAM.2018.08.022zbMath1401.05223OpenAlexW2897850773WikidataQ129097715 ScholiaQ129097715MaRDI QIDQ1634760

Y. Aharonov

Publication date: 18 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.022




Related Items (6)




Cites Work




This page was built for publication: Computing a minimum paired-dominating set in strongly orderable graphs