Login / Signup

Decompositions of highly connected graphs into paths of length 3.

Carsten Thomassen
Published in: J. Graph Theory (2008)
Keyphrases
  • highly connected
  • path length
  • databases
  • shortest path
  • singular value decomposition
  • biologically inspired