Login / Signup

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs.

Feng Ming DongKhee Meng KohKee L. TeoC. H. C. LittleMichael D. Hendy
Published in: J. Graph Theory (2001)
Keyphrases
  • bipartite graph
  • data sets
  • social networks
  • computational complexity
  • lower bound
  • bipartite graph matching