Subset Problems in Higher Chordality and 2K2 free graphs Structural and Algorithmic View

Abstract

The objective of this thesis is to study the structure of strictly chordality k graphs, k and#8805; 5, and 2K2-free graphs. Further, using our structural understanding, we investigate the complexity of some subset problems restricted to these graphs. This thesis also focuses on r-connectivity augmentation in trees, r and#8805; 2. We highlight some of the main results presented in this thesis as follows.