Login / Signup

The maximum number of paths of length three in a planar graph.

Andrzej GrzesikErvin GyöriAddisu PaulosNika SaliaCasey TompkinsOscar Zamora
Published in: J. Graph Theory (2022)
Keyphrases
  • maximum number
  • planar graphs
  • shortest path
  • minimum weight
  • input image
  • probabilistic inference
  • bipartite graph