Login / Signup

On the number of edges in a graph with no (k+1)-connected subgraphs.

Anton BernshteynAlexandr V. Kostochka
Published in: Discret. Math. (2016)
Keyphrases
  • undirected graph
  • weighted graph
  • directed edges
  • social networks
  • feature selection
  • image segmentation
  • data streams
  • computational model
  • directed graph
  • graph theory