Structure for algorithms, graph reconstruction and hypercube intersections
<p>We begin by studying several structural properties of graphs that lead to 'efficient' colouring algorithms. We first show that the treedepth of a <em>P<sub>t</sub></em>-free graph is bounded by <em>t</em> times its maximum degree, and use this t...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2020
|
| Subjects: |