Author:
Kloks Ton,Lee Chuan-Min,Liu Jiping,Müller Haiko
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Anbeek, C., DeTemple, D., McAvaney, K., Robertson, J.: When are chordal graphs also partition graphs? Australas. J. Combin. 16, 285–293 (1997)
2. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes–A Survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)
3. Lecture Notes in Computer Science;H.J. Broersma,1997
4. Bron, S., Kerbosch, J.: Algorithm 457–Finding all cliques of an undirected graph. Comm. of ACM 16, 575 (1973)
5. Chvátal, V., Slater, P.J.: A note on well-covered graphs. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory? Annals of Discrete Mathematics, vol. 55, pp. 179–182 (1993)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献