Computing roots of graphs is hard
- 26 September 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 54 (1) , 81-88
- https://doi.org/10.1016/0166-218x(94)00023-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- Characterization of n-path graphs and of graphs having nth rootJournal of Combinatorial Theory, Series B, 1974
- The square of every two-connected graph is HamiltonianJournal of Combinatorial Theory, Series B, 1974
- The square root of a digraphJournal of Combinatorial Theory, 1968
- A criterion for planarity of the square of a graphJournal of Combinatorial Theory, 1967
- The square root of a graphJournal of Combinatorial Theory, 1967
- The Square of a TreeBell System Technical Journal, 1960