Author:
Lozin Vadim V.,Mayhill Colin
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference24 articles.
1. Asdre, K., Nikolopoulos, S.D.: NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theor. Comput. Sci. 381, 248–259 (2007)
2. Benzaken, C., Hammer, P.L., de Werra, D.: Split graphs of Dilworth number 2. Discrete Math. 55, 123–127 (1985)
3. Bogart, K.P., West, D.B.: A short proof that proper = unit. Discrete Math. 201, 21–23 (1999)
4. Bodlaender, H.L., Kloks, T., Niedermeier, R.: Simple MAX-CUT for unit interval graphs and graphs with few P 4s. Electron. Notes Discrete Math. 3, 1–8 (1999)
5. Brandstädt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67, 273–289 (2003)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献