Peter Gartland

From MaRDI portal
(Redirected from Peter Gartland)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
(available as arXiv preprint)
N/APaper
Tree independence number. IV: Even-hole-free graphs2026-07-03Paper
Independent set on P_k-free graphs in quasi-polynomial time2025-08-12Paper
Graph classes with few minimal separators. I: Finite forbidden induced subgraphs2024-05-14Paper
Graph classes with few minimal separators. II: A dichotomy2024-05-14Paper
Tree Independence Number IV. Even-hole-free Graphs
(available as arXiv preprint)
2024-01-01Paper
Finding large induced sparse subgraphs in <i> c <sub>&gt;t</sub> </i> -free graphs in quasipolynomial time
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
On Induced Versions of Menger's Theorem on Sparse Graphs2023-09-15Paper
On Induced Versions of Menger's Theorem on Sparse Graphs
(available as arXiv preprint)
2023-01-01Paper
Dominated Minimal Separators are Tame (Nearly All Others are Feral)2020-07-17Paper
A new characterization of \(\mathcal{V} \)-posets
Order
2020-07-17Paper
Dominated Minimal Separators are Tame (Nearly All Others are Feral)
(available as arXiv preprint)
2020-01-01Paper
Perfect secure domination in graphs2017-10-11Paper


Research outcomes over time


This page was built for person: Peter Gartland