Login / Signup

Minors in large almost-5-connected non-planar graphs.

Ken-ichi KawarabayashiJohn Maharry
Published in: J. Graph Theory (2012)
Keyphrases
  • planar graphs
  • connected components
  • minimum weight
  • linear programming
  • latent variables
  • boundary points