Login / Signup

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices.

Derek A. HoltonBrendan D. McKay
Published in: J. Comb. Theory, Ser. B (1988)
Keyphrases
  • planar graphs
  • minimum weight
  • connected components
  • belief propagation
  • undirected graph
  • data points
  • traveling salesman problem
  • weighted graph
  • approximate inference