Siani Smith

activity

20202025

most citedPartitioning H-Free Graphs of Bounded Diameter

3 citations · 8 across the 17 of their papers we have counts for

collaborators

Showing 2021 · math.COShow all

3 papers · 2 filters

math.CO2021

Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter

Barnaby Martin, Daniel Paulusma, Siani Smith

For a fixed integer, the $k$ -Colouring problem is to decide if the vertices of a graph can be coloured with at most $k$ colours for an integer $k$ , such that no two adjacent vertic…

math.CO2021

Disjoint Paths and Connected Subgraphs for H-Free Graphs

Walter Kern, Barnaby Martin, Daniël Paulusma +2

The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We deter…

math.CO2021

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles

Barnaby Martin, Daniel Paulusma, Siani Smith

For $k \geq 1$ , a $k$ -colouring $c$ of $G$ is a mapping from $V (G)$ to ${1, 2, \dots, k}$ such that $c (u) \neq = c (v)$ for any two non-adjacent vertices $u$ and $v$ . The $k$ -Colouring…