Sign in

Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph.

Dirk MeierlingSeyed Mahmoud SheikholeslamiLutz Volkmann
Published in: Appl. Math. Lett. (2011)
Keyphrases
  • small number
  • maximum number
  • computational complexity
  • directed graph
  • fixed number
  • data sets
  • case study
  • bipartite graph
  • graph structure
  • graph model