Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Babu, J., Chandran, L.S., Vaidyanathan, K.: Rainbow matchings in strongly edge-colored graphs. Discrete Math. 338(7), 1191–1196 (2015)
2. Cheng, Y., Tan, T.S., Wang, G.: A note on rainbow matchings in strongly edge-colored graphs. Discrete Math. 341(10), 2762–2767 (2018)
3. Diemunsch, J., Ferrara, M., Lo, A., Moffatt, C., Pfender, F., Wenger, P.S.: Rainbow matchings of size $$\delta (G)$$ in properly edge-colored graphs. Electron. J. Combin. 19(2), 52 (2012)
4. Diestel, R.: Graph theory. Graduate Texts in Mathematics, 5th edn. Springer, Berlin (2018)
5. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of np-completeness. W. H. Freeman (1979)