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 2022 · math.COShow all

3 papers · 2 filters

math.CO2022★ 1 cited

Complexity Framework For Forbidden Subgraphs I: The Framework

Matthew Johnson, Barnaby Martin, Jelle J. Oostveen +4

For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. T…

math.CO2022

Few Induced Disjoint Paths for $H$ -Free Graphs

Barnaby Martin, Daniël Paulusma, Siani Smith +1

Paths $P^{1}, \dots, P^{k}$ in a graph $G = (V, E)$ are mutually induced if any two distinct $P^{i}$ and $P^{j}$ have neither common vertices nor adjacent vertices. For a fixed integer $k$ , th…

math.CO2022

Induced Disjoint Paths and Connected Subgraphs for $H$ -Free Graphs

Barnaby Martin, Daniël Paulusma, Siani Smith +1

Paths $P_{1}, \dots, P_{k}$ in a graph $G = (V, E)$ are mutually induced if any two distinct $P_{i}$ and $P_{j}$ have neither common vertices nor adjacent vertices. The Induced Disjoint Paths…

Complexity Framework For Forbidden Subgraphs I: The Framework

Few Induced Disjoint Paths for H-Free Graphs

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs

Few Induced Disjoint Paths for $H$ -Free Graphs

Induced Disjoint Paths and Connected Subgraphs for $H$ -Free Graphs