Computing square roots of trivially perfect and threshold graphs

This publication has 30 references indexed in Scilit:

• Complexity of Finding Graph Roots with Girth Conditions
  Algorithmica, 2010
• The square of a block graph
  Discrete Mathematics, 2010
• The NLC-width and clique-width for powers of graphs of bounded tree-width
  Discrete Applied Mathematics, 2009
• A result on the total colouring of powers of cycles
  Discrete Applied Mathematics, 2007
• Bipartite roots of graphs
  ACM Transactions on Algorithms, 2006
• On uniquely intersectable graphs
  Discrete Mathematics, 1999
• Computing roots of graphs is hard
  Discrete Applied Mathematics, 1994
• Trivially perfect graphs
  Discrete Mathematics, 1978
• Time bounds for selection
  Journal of Computer and System Sciences, 1973
• The comparability graph of a tree
  Proceedings of the American Mathematical Society, 1962