Excluding Induced Paths: Graph Structure and Coloring
An induced subgraph of a given graph is any graph which can be obtained by successively deleting vertices, possible none. In this thesis, we present several new structural and algorithmic results on a number of different classes of graphs which are closed under taking induced subgraphs. The fi...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | https://doi.org/10.7916/D8WW7GK4 |