ON RECONSTRUCTION OF A GRAPH OF CONNECTIVITY 2 HAVING A 2-VERTEX SET DIVIDING IT INTO AT LEAST 3 PARTS
Crossref DOI link: https://doi.org/10.1007/s10958-026-08363-w
Published Online: 2026-03-09
Published Print: 2026-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Karpov, D. V.
Text and Data Mining valid from 2026-03-01
Version of Record valid from 2026-03-01
Article History
Received: 2 December 2022
First Online: 9 March 2026
Declarations
:
: This manuscript has no associated data.
: Not applicable.
: The authors declare that there is no conflict of interest.