Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics
Reference38 articles.
1. Asdre K., Nikolopoulos S.D.: NP–completeness results for some problems on subclasses of bipartite and chordal graphs. Theoret. Comput. Sci. 381(1-3), 248–259 (2007)
2. Chandran L.S., Lozin V.V., Subramanian C.R.: Graphs of low chordality. DiscreteMath. Theor. Comput. Sci. 7(1), 25–35 (2005)
3. Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Ann. of Math. (2) 164(1), 51–229 (2006)
4. Baker B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach. 41(1), 153–180 (1994)
5. Brandstä A., Lozin V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Combin. 67, 273–281 (2003)
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献