Best lower bound for the maximum heterochromatic matchings in edge-colored bipartite graphs
classification
🧮 math.CO
keywords
authorbeenbestbipartiteboundedge-colorederrorgraphs
read the original abstract
This paper has been withdrawn by the author(s), due an error in the proof.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.