Graph Square Roots of Small Distance from Degree One Graphs
- 30 April 2022
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 66 (4) , 1-26
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Complexity of Finding Graph Roots with Girth ConditionsAlgorithmica, 2010
- The square of a block graphDiscrete Mathematics, 2010
- Bipartite roots of graphsACM Transactions on Algorithms, 2006
- Recognizing Powers of Proper Interval, Split, and Chordal GraphsSIAM Journal on Discrete Mathematics, 2004
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- Algorithms for Square Roots of GraphsSIAM Journal on Discrete Mathematics, 1995
- Computing roots of graphs is hardDiscrete Applied Mathematics, 1994
- An application of simultaneous diophantine approximation in combinatorial optimizationCombinatorica, 1987
- Node-Deletion Problems on Bipartite GraphsSIAM Journal on Computing, 1981