Author:
Cicalese Ferdinando,Milanič Martin
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, 11–24 (1989)
2. Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19, 247–253 (1989)
3. Berge, C.: Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 10, 114 (1961)
4. Lecture Notes in Computer Science;R. Boliac,2002
5. North-Holland Math. Stud.;M. Burlet,1984
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graphs of separability at most 2;Discrete Applied Mathematics;2012-04