The three-in-a-tree problem
From MaRDI portal
Publication:653792
DOI10.1007/s00493-010-2334-4zbMath1231.05246OpenAlexW2104062785MaRDI QIDQ653792
Maria Chudnovsky, P. D. Seymour
Publication date: 19 December 2011
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-010-2334-4
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The four-in-a-tree problem in triangle-free graphs, Detecting a long even hole, The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs, The \(k\)-in-a-tree problem for graphs of girth at least \(k\), Detecting an induced subdivision of \(K_{4}\), MIP formulations for induced graph optimization problems: a tutorial, Finding a shortest even hole in polynomial time, Maximum weighted induced forests and trees: new formulations and a computational comparative review, Large Induced Subgraphs via Triangulations and CMSO, Exact Solution Algorithms for the Chordless Cycle Problem, Finding induced paths of given parity in claw-free graphs, The \(k\)-in-a-path problem for claw-free graphs, Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs, FPT and kernelization algorithms for the induced tree problem, On the forbidden induced subgraph sandwich problem, Detecting an induced net subdivision, Finding an induced subdivision of a digraph, The (theta, wheel)-free graphs. IV: Induced paths and cycles, Finding a subdivision of a digraph, The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs, CIO and ring graphs: deficiency and testing, Detecting induced subgraphs, A Class of Three‐Colorable Triangle‐Free Graphs, Finding induced trees, Induced Disjoint Paths in Claw-Free Graphs, A structure theorem for graphs with no cycle with a unique chord and its consequences, The sandwich problem for decompositions and almost monotone properties, Induced disjoint paths in AT-free graphs, Clique or hole in claw-free graphs, Unnamed Item, Faster 3-Coloring of Small-Diameter Graphs, A faster algorithm to recognize even-hole-free graphs
Cites Work
