Complexity results for two kinds of colored disconnections of graphs
Crossref DOI link: https://doi.org/10.1007/s10878-021-00742-0
Published Online: 2021-04-16
Published Print: 2021-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chen, You
Li, Ping
Li, Xueliang http://orcid.org/0000-0002-8335-9873
Weng, Yindi
Funding for this research was provided by:
National Natural Science Foundation of China (11871034)
Text and Data Mining valid from 2021-04-16
Version of Record valid from 2021-04-16
Article History
Accepted: 8 April 2021
First Online: 16 April 2021