We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Computing square roots of graphs with low maximum degree.

Cochefert, M. and Couturier, J-F. and Golovach, P.A. and Kratsch, D. and Paulusma, D. and Stewart, A. (2018) 'Computing square roots of graphs with low maximum degree.', Discrete applied mathematics., 248 . pp. 93-101.


A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial minor-closed graph classes and a very limited number of other graph classes. We prove that Square Root is O(n)-time solvable for graphs of maximum degree 5 and O(n4)-time solvable for graphs of maximum degree at most 6.

Item Type:Article
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF
Publisher Web site:
Publisher statement:© 2017 This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Date accepted:02 May 2017
Date deposited:23 May 2017
Date of first online publication:22 May 2017
Date first made open access:22 May 2018

Save or Share this output

Look up in GoogleScholar