SchroderThesis

https://fpt.akt.tu-berlin.de/publications/theses/BA-Schr%C3%B6der.pdf

@thesis{SchroderThesis,
author = {Johannes Christoph Benjamin Schröder},
institution = {Technische Universität Berlin},
title = {Comparing Graph Parameters},
type = {Bachelor's Thesis},
url = {https://fpt.akt.tu-berlin.de/publications/theses/BA-Schr%C3%B6der.pdf},
}

• Sorge2019 – Based on the work by [Sa19] as well as [Fr8], we investigate unknown connections between graph parameters to continue the work on the graph parameter hierarchy
• Froemmrich2018 – Based on the work by [Sa19] as well as [Fr8], we investigate unknown connections between graph parameters to continue the work on the graph parameter hierarchy
• page 11 : treedepth $k$ upper bounds diameter by $\mathcal O(k)$ – Proposition 3.1
• page 12 : distance to linear forest $k$ upper bounds h-index by $\mathcal O(k)$ – Proposition 3.2
• page 13 : bounded distance to cluster does not imply bounded distance to co-cluster – Proposition 3.3
• page 14 : bounded distance to co-cluster does not imply bounded boxicity – Proposition 3.4
• page 15 : bounded vertex cover does not imply bounded domination number – Proposition 3.5
• page 15 : bounded clique cover number does not imply bounded distance to perfect – Proposition 3.6
• page 16 : bounded distance to complete does not imply bounded maximum clique – Proposition 3.7
• page 16 : bounded distance to complete does not imply bounded domatic number – Proposition 3.7
• page 16 : bounded distance to complete does not imply bounded vertex connectivity – Proposition 3.8
• page 16 : bounded clique cover number does not imply bounded clique-width – Proposition 3.9
• page 19 : bounded clique cover number does not imply bounded chordality – Proposition 3.11
• page 19 : bounded distance to perfect does not imply bounded chordality – Proposition 3.11
• page 20 : bounded distance to co-cluster does not imply bounded distance to chordal – Proposition 3.12
• page 20 : bounded distance to bipartite does not imply bounded distance to chordal – Proposition 3.12
• page 20 : bounded distance to co-cluster does not imply bounded vertex connectivity – Proposition 3.12
• page 20 : bounded distance to bipartite does not imply bounded vertex connectivity – Proposition 3.12
• page 20 : bounded distance to co-cluster does not imply bounded domatic number – Proposition 3.12
• page 20 : bounded distance to bipartite does not imply bounded domatic number – Proposition 3.12
• page 21 : bounded bandwidth does not imply bounded distance to planar – Proposition 3.13
• page 21 : bounded treedepth does not imply bounded distance to planar – Proposition 3.13
• page 21 : bounded maximum leaf number does not imply bounded girth – Proposition 3.14
• page 23 : bounded feedback edge set does not imply bounded pathwidth – Proposition 3.16
• page 23 : bounded genus does not imply bounded clique-width – Proposition 3.17
• page 23 : bounded distance to planar does not imply bounded clique-width – Proposition 3.17
• page 24 : bounded vertex cover does not imply bounded genus – Proposition 3.18
• page 24 : bounded vertex cover does not imply bounded maximum degree – Proposition 3.19
• page 24 : bounded vertex cover does not imply bounded bisection bandwidth – Proposition 3.20
• page 25 : bounded feedback edge set does not imply bounded distance to interval – Proposition 3.21
• page 25 : bounded treedepth does not imply bounded h-index – Proposition 3.22
• page 25 : bounded feedback edge set does not imply bounded h-index – Proposition 3.22
• page 26 : bounded distance to outerplanar does not imply bounded distance to perfect – Proposition 3.23
• page 26 : bounded bandwidth does not imply bounded distance to perfect – Proposition 3.24
• page 26 : bounded genus does not imply bounded distance to perfect – Proposition 3.24
• page 26 : bounded treedepth does not imply bounded distance to perfect – Proposition 3.24
• page 27 : bounded distance to chordal does not imply bounded boxicity – Proposition 3.25
• page 28 : bounded maximum degree does not imply bounded clique-width – Proposition 3.26
• page 28 : bounded maximum degree does not imply bounded bisection bandwidth – Proposition 3.26
• page 28 : bounded distance to bipartite does not imply bounded clique-width – Proposition 3.26
• page 28 : bounded distance to bipartite does not imply bounded bisection bandwidth – Proposition 3.26
• page 30 : bounded bandwidth does not imply bounded genus – Proposition 3.27
• page 30 : bounded bisection bandwidth does not imply bounded domatic number – Proposition 3.28
• page 30 : bounded feedback edge set does not imply bounded bisection bandwidth – Proposition 3.29
• page 31 : bounded domatic number does not imply bounded vertex connectivity – Proposition 3.30
• page 33 : bounded bisection bandwidth does not imply bounded chordality – Proposition 3.31
• page 33 : bounded bisection bandwidth does not imply bounded clique-width – Proposition 3.32
• page 33 : bounded bisection bandwidth does not imply bounded maximum clique – Proposition 3.33
• page 33 : bounded genus does not imply bounded distance to planar – Proposition 3.34
• page 35 : bounded average degree does not imply bounded maximum clique – Proposition 3.35
• page 36 : bounded average degree does not imply bounded chordality – Proposition 3.36