• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the number of disjoint perfect matchings of regular graphs with given edge connectivity.

Hongliang LuYuqing Lin
Published in: Discret. Math. (2017)
Keyphrases
  • computational complexity
  • real time
  • data sets
  • case study
  • edge detector
  • weighted graph
  • undirected graph