Strict 2-threshold graphs |
| |
| Affiliation: | Department of Mathematics, Northeastern University, Boston, MA 02115, USA;Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, IL 60680, USA |
| |
| Abstract: | A graph G is called a strict 2-threshold graph if its edge-set can be partitioned into two threshold graphs T1 and T2 such that every triangle of G is also a triangle of T1 or of T2. We indicate a polynomial-time algorithm to recognize these graphs and characterize them by forbidden configurations. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
