论文信息 - On the semi-perfect elimination - 字舞流文

On the semi-perfect elimination

S. Olariu | B. Jamison

[1] Stephan Olariu,et al. Weak bipolarizable graphs , 1989, Discret. Math..

[2] S. Olariu,et al. A New Class of Brittle Graphs , 1989 .

[3] Dominique de Werra,et al. Four classes of perfectly orderable graphs , 1987, J. Graph Theory.

[4] Dominique de Werra,et al. A note on superbrittle graphs , 1986, Discret. Math..

[5] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[6] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[7] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .

[8] G. Dirac. On rigid circuit graphs , 1961 .

[9] V. Chvátal. Perfectly Ordered Graphs , 1984 .

[10] V. Chvátal,et al. Topics on perfect graphs , 1984 .

[11] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .