Comparing Graph Parameters by Schröder

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},
}

• page 11 : treedepth upper bounds diameter by an exponential function – Proposition 3.1
• page 12 : distance to linear forest upper bounds h-index by a linear function – Proposition 3.2
• page 13 : graph classes with bounded distance to cluster are not bounded distance to co-cluster – Proposition 3.3
• page 14 : graph classes with bounded distance to co-cluster are not bounded boxicity – Proposition 3.4
• page 15 : graph classes with bounded vertex cover are not bounded domination number – Proposition 3.5
• page 15 : graph classes with bounded clique cover number are not bounded distance to perfect – Proposition 3.6
• page 16 : graph classes with bounded distance to complete are not bounded maximum clique – Proposition 3.7
• page 16 : graph classes with bounded distance to complete are not bounded domatic number – Proposition 3.7
• page 16 : graph classes with bounded clique cover number are not bounded clique-width – Proposition 3.9
• page 19 : graph classes with bounded clique cover number are not bounded chordality – Proposition 3.11
• page 19 : graph classes with bounded distance to perfect are not bounded chordality – Proposition 3.11
• page 20 : graph classes with bounded distance to co-cluster are not bounded distance to chordal – Proposition 3.12
• page 20 : graph classes with bounded distance to bipartite are not bounded distance to chordal – Proposition 3.12
• page 20 : graph classes with bounded distance to co-cluster are not bounded domatic number – Proposition 3.12
• page 20 : graph classes with bounded distance to bipartite are not bounded domatic number – Proposition 3.12
• page 21 : graph classes with bounded bandwidth are not bounded distance to planar – Proposition 3.13
• page 21 : graph classes with bounded treedepth are not bounded distance to planar – Proposition 3.13
• page 23 : graph classes with bounded feedback edge set are not bounded pathwidth – Proposition 3.16
• page 23 : graph classes with bounded genus are not bounded clique-width – Proposition 3.17
• page 23 : graph classes with bounded distance to planar are not bounded clique-width – Proposition 3.17
• page 24 : graph classes with bounded vertex cover are not bounded genus – Proposition 3.18
• page 24 : graph classes with bounded vertex cover are not bounded maximum degree – Proposition 3.19
• page 24 : graph classes with bounded vertex cover are not bounded bisection bandwidth – Proposition 3.20
• page 25 : graph classes with bounded feedback edge set are not bounded distance to interval – Proposition 3.21
• page 25 : graph classes with bounded treedepth are not bounded h-index – Proposition 3.22
• page 25 : graph classes with bounded feedback edge set are not bounded h-index – Proposition 3.22
• page 26 : graph classes with bounded distance to outerplanar are not bounded distance to perfect – Proposition 3.23
• page 26 : graph classes with bounded bandwidth are not bounded distance to perfect – Proposition 3.24
• page 26 : graph classes with bounded genus are not bounded distance to perfect – Proposition 3.24
• page 26 : graph classes with bounded treedepth are not bounded distance to perfect – Proposition 3.24
• page 27 : graph classes with bounded distance to chordal are not bounded boxicity – Proposition 3.25
• page 28 : graph classes with bounded maximum degree are not bounded clique-width – Proposition 3.26
• page 28 : graph classes with bounded maximum degree are not bounded bisection bandwidth – Proposition 3.26
• page 28 : graph classes with bounded distance to bipartite are not bounded clique-width – Proposition 3.26
• page 28 : graph classes with bounded distance to bipartite are not bounded bisection bandwidth – Proposition 3.26
• page 30 : graph classes with bounded bandwidth are not bounded genus – Proposition 3.27
• page 30 : graph classes with bounded bisection bandwidth are not bounded domatic number – Proposition 3.28
• page 30 : graph classes with bounded feedback edge set are not bounded bisection bandwidth – Proposition 3.29
• page 33 : graph classes with bounded bisection bandwidth are not bounded chordality – Proposition 3.31
• page 33 : graph classes with bounded bisection bandwidth are not bounded clique-width – Proposition 3.32
• page 33 : graph classes with bounded bisection bandwidth are not bounded maximum clique – Proposition 3.33
• page 33 : graph classes with bounded genus are not bounded distance to planar – Proposition 3.34
• page 35 : graph classes with bounded average degree are not bounded maximum clique – Proposition 3.35
• page 36 : graph classes with bounded average degree are not bounded chordality – Proposition 3.36