2 papers
math.CO2022
Graphs of Linear Growth have Bounded Treewidth
Rutger Campbell, Marc Distel, J. Pascal Gollin +5
A graph class has linear growth if, for each graph and every positive integer , every subgraph of with radius at most contains v…
math.CO2021
Counting cliques in -planar graphs
J. Pascal Gollin, Kevin Hendrey, Abhishek Methuku +2
The problem of maximising the number of cliques among -vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of…