An Upper Bound on the Number of Edges of a Graph Whose kth Power Has a Connected Complement
Crossref DOI link: https://doi.org/10.1007/s10958-018-3860-7
Published Online: 2018-05-25
Published Print: 2018-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Samoilov, V. S.
Text and Data Mining valid from 2018-05-25
Article History
Received: 14 October 2016
First Online: 25 May 2018