The following pages link to Siani Smith (Q2055972):
Displayed 30 items.
- Hard problems that quickly become very easy (Q2059897) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Injective colouring for H-free graphs (Q2117071) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- (Q5874489) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6039437) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- QCSP on Reflexive Tournaments (Q6075950) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q6090539) (← links)
- (Q6147518) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q6166893) (← links)
- Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs (Q6347488) (← links)
- Acyclic, Star, and Injective Colouring: Bounding the Diameter (Q6365823) (← links)
- Partitioning H-Free Graphs of Bounded Diameter (Q6367297) (← links)
- Disjoint Paths and Connected Subgraphs for H-Free Graphs (Q6367593) (← links)
- Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter (Q6383756) (← links)
- Few Induced Disjoint Paths for $H$-Free Graphs (Q6393005) (← links)
- Complexity Framework For Forbidden Subgraphs I: The Framework (Q6418235) (← links)
- Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision (Q6418480) (← links)
- Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs (Q6434976) (← links)
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem (Q6435083) (← links)