Bipartite Graphs Totally Decomposable by Canonical Decomposition
暂无分享,去创建一个
Vassilis Giakoumakis | Jean-Marie Vanherpe | Jean-Luc Fouquet | V. Giakoumakis | J. Fouquet | J. Vanherpe
[1] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[2] W. Cunningham. Decomposition of Directed Graphs , 1982 .
[3] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[4] Peter L. Hammer,et al. The splittance of a graph , 1981, Comb..
[5] Dieter Kratsch,et al. Bandwidth of Chain Graphs , 1998, Inf. Process. Lett..
[6] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..
[7] Bruno Courcelle,et al. Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..
[8] Andreas Brandstädt. Classes of bipartite graphs related to chordal graphs , 1991, Discret. Appl. Math..