On the strong chromatic index of cubic Halin graphs
暂无分享,去创建一个
[1] Moshe Lewenstein,et al. New results on induced matchings , 2000, Discret. Appl. Math..
[2] Dennis Saleh. Zs , 2001 .
[3] P. C. B. Lam,et al. On strong chromatic index of Halin graph , 2006 .
[4] R. Schelp,et al. THE STRONG CHROMATIC INDEX OF GRAPHS , 1990 .
[5] Mohammad Mahdian. On the computational complexity of strong edge coloring , 2002, Discret. Appl. Math..
[6] William T. Trotter,et al. Induced matchings in cubic graphs , 1993, J. Graph Theory.
[7] Wai Chee Shiu,et al. The strong chromatic index of complete cubic Halin graphs , 2009, Appl. Math. Lett..
[8] Lars Døvling Anderson. The strong chromatic index of a cubic graph is at most 10 , 1992 .
[9] Mohammad R. Salavatipour. A polynomial time algorithm for strong edge coloring of partial k-trees , 2004, Discret. Appl. Math..
[10] Angelika Steger,et al. On induced matchings , 1993, Discret. Math..
[11] Jessica Engel,et al. Problem , 1902 .