Enumerative aspects of certain subclasses of perfect graphs
暂无分享,去创建一个
[1] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[2] D. G. Rogers,et al. Some correspondences involving the schröder numbers and relations , 1978 .
[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[4] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..
[5] V. Krishnamurhty. Combinatorics Theory and Applications , 1985 .
[6] D. G. Rogers,et al. Deques, trees and lattice paths , 1981 .
[7] Uri N. Peled,et al. Enumeration of Difference Graphs , 1995, Discret. Appl. Math..
[8] Louis W. Shapiro,et al. Bootstrap Percolation, the Schröder Numbers, and the N-Kings Problem , 1991, SIAM J. Discret. Math..
[9] Uri N. Peled,et al. Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials , 1987, Graphs Comb..
[10] N. Mahadev,et al. Threshold graphs and related topics , 1995 .
[11] C. Schensted. Longest Increasing and Decreasing Subsequences , 1961, Canadian Journal of Mathematics.
[12] Martin Charles Golumbic,et al. Trivially perfect graphs , 1978, Discret. Math..
[13] Donald E. Knuth,et al. PERMUTATIONS, MATRICES, AND GENERALIZED YOUNG TABLEAUX , 1970 .
[14] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .
[15] E. S. Wolk. A note on “The comparability graph of a tree” , 1965 .