Login / Signup

Upper bounds on the edge clique cover number of a graph.

Robert C. BrighamRonald D. Dutton
Published in: Discret. Math. (1984)
Keyphrases
  • upper bound
  • lower bound
  • small number
  • undirected graph
  • edge detection
  • graph theory
  • graph theoretic
  • computational complexity
  • special case
  • semi supervised
  • bipartite graph
  • finite number