Graph classes: a survey
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Graphs of bounded rank-width
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing
Probe threshold and probe trivially perfect graphs
Theoretical Computer Science
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Width Parameters Beyond Tree-width and their Applications
The Computer Journal
Hi-index | 0.00 |
Let k be a natural number. We introduce k-threshold graphs. We show that there exists an O(n3) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of forbidden induced subgraphs. For the case k = 2 we characterize the partitioned 2-threshold graphs by forbidden induced subgraphs. We introduce restricted, and special 2-threshold graphs. We characterize both classes by forbidden induced subgraphs. The restricted 2-threshold graphs coincide with the switching class of threshold graphs. This provides a decomposition theorem for the switching class of threshold graphs.