On induced matchings
暂无分享,去创建一个
[1] Zsolt Tuza,et al. The maximum number of edges in 2K2-free graphs of bounded degree , 1990, Discret. Math..
[2] Lars Døvling Anderson. The strong chromatic index of a cubic graph is at most 10 , 1992 .
[3] Zsolt Tuza,et al. Induced matchings in bipartite graphs , 1989, Discret. Math..
[4] Jean-Claude Bermond,et al. Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY , 1983 .
[5] Paul Erdös,et al. Problems and results in combinatorial analysis and graph theory , 1988, Discret. Math..