On convexity in split graphs: complexity of Steiner tree and domination
Crossref DOI link: https://doi.org/10.1007/s10878-024-01105-1
Published Online: 2024-02-12
Published Print: 2024-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Mohanapriya, A. https://orcid.org/0000-0001-5946-1117
Renjith, P.
Sadagopan, N.
Funding for this research was provided by:
National Board for Higher Mathematics (02011/24/2023/6051)
Text and Data Mining valid from 2024-02-12
Version of Record valid from 2024-02-12
Article History
Accepted: 3 January 2024
First Online: 12 February 2024
Declarations
:
: The authors have not disclosed any competing interests.