论文信息 - Strict 2-threshold graphs

Strict 2-threshold graphs

Abstract A graph G is called a strict 2- threshold graph if its edge-set can be partitioned into two threshold graphs T 1 and T 2 such that every triangle of G is also a triangle of T 1 or of T 2 . We indicate a polynomial-time algorithm to recognize these graphs and characterize them by forbidden configurations.

Nadimpalli V. R. Mahadev | Uri N. Peled | N. Mahadev | U. Peled

[1] P. Hammer,et al. Aggregation of inequalities in integer programming. , 1975 .

[2] M. Yannakakis. The Complexity of the Partial Order Dimension Problem , 1982 .

[3] T. Ibaraki,et al. Sufficient Conditions for Graphs to Have Threshold Number 2 , 1981 .

[4] Peter L. Hammer,et al. Some properties of 2-threshold graphs , 1989, Networks.

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

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

[7] F. Harary. On the notion of balance of a signed graph. , 1953 .