Bounds On The Labelling Numbers Of Chordal Graphs
暂无分享,去创建一个
[1] Mehdi Behzad,et al. Graphs and Digraphs , 1981, The Mathematical Gazette.
[2] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[3] Denise Sakai,et al. Labeling Chordal Graphs: Distance Two Condition , 1994 .
[4] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[5] G. Dirac. On rigid circuit graphs , 1961 .
[6] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..
[7] B. Peyton,et al. An Introduction to Chordal Graphs and Clique Trees , 1993 .
[8] Blair J R S,et al. Introduction to Chordal Graphs and Clique Trees, in Graph Theory and Sparse Matrix Computation , 1997 .