Login / Signup

Generating all 3-connected 4-regular planar graphs from the octahedron graph.

Haitze J. BroersmaA. J. W. DuijvestijnF. Göbel
Published in: J. Graph Theory (1993)
Keyphrases
  • planar graphs
  • connected components
  • minimum weight
  • weighted graph
  • approximate inference
  • random walk