In the context of graph theory, an \((a, b)\)-decomposition refers to a way of partitioning the edges of a graph into specific subsets with certain properties, often focusing on achieving balance in terms of the number of edges in each subset.

Ancestors (5)

  1. Graph invariants
  2. Graph theory
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version