Login / Signup

The number of vertices of degree 5 in a contraction-critically 5-connected graph.

Kiyoshi AndoTakashi Iwase
Published in: Discret. Math. (2011)
Keyphrases
  • random graphs
  • connected graphs
  • small number
  • neural network
  • undirected graph
  • maximum number
  • lower bound
  • spanning tree
  • graph partitioning
  • graph theoretic