Clique-width of partner-limited graphs
暂无分享,去创建一个
[1] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[2] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[3] Florian Roussel,et al. On Graphs with Limited Number of P4-Partners , 1999, Int. J. Found. Comput. Sci..
[4] Vassilis Giakoumakis,et al. On P 4 -tidy graphs , 1997 .
[5] Vassilis Giakoumakis,et al. Bipartite Graphs Totally Decomposable by Canonical Decomposition , 1999, Int. J. Found. Comput. Sci..
[6] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[7] Stephan Olariu,et al. On the Structure of Graphs with Few P4s , 1998, Discret. Appl. Math..
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Bruno Courcelle,et al. Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..