Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs

Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Type: Book-Chapter

Publication Date: 2022-01-01

Citations: 1

DOI: https://doi.org/10.1007/978-3-031-15914-5_29

View Publication

Locations

Lecture notes in computer science - View
Durham Research Online (Durham University) - View - PDF
arXiv (Cornell University) - View - PDF
Data Archiving and Networked Services (DANS) - View - PDF
Durham Research Online (Durham University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Induced Disjoint Paths and Connected Subgraphs for $H$-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Few Induced Disjoint Paths for $H$-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	Few Induced Disjoint Paths for H-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Disjoint Paths and Connected Subgraphs for H-Free Graphs	2021	Walter Kern Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Few induced disjoint paths for H-free graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs	2023	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	Disjoint Paths and Connected Subgraphs for H-Free Graphs	2021	Walter Kern Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	Disjoint paths and connected subgraphs for H-free graphs	2021	Walter Kern Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+	Induced Disjoint Paths in AT-free Graphs	2020	Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen
+	Connected Vertex Cover for $(sP_1+P_5)$-Free Graphs	2017	Matthew Johnson Giacomo Paesani Daniël Paulusma
+	Connected Vertex Cover for $(sP_1+P_5)$-Free Graphs	2017	Matthew Johnson Giacomo Paesani Daniël Paulusma
+	Induced Disjoint Paths in Claw-Free Graphs	2012	Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen
+	Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective	2020	Hans L. Bodlaender Nick Brettell Matthew Johnson Giacomo Paesani Daniël Paulusma Erik Jan van Leeuwen
+	Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective	2020	Hans L. Bodlaender Nick Brettell Matthew Johnson Giacomo Paesani Daniël Paulusma Erik Jan van Leeuwen
+	Connected greedy coloring $H$-free graphs	2018	Esdras Mota Ana Silva Leonardo Sampaio
+	A Polynomial Time Algorithm for the $k$-Disjoint Shortest Paths Problem	2019	William Lochet
+	Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs	2014	Konrad K. Dabrowski Daniël Paulusma
+	Connected greedy coloring $H$-free graphs	2018	Esdras Mota Ana Silva Leonardo Sampaio
+ PDF Chat	Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs	2015	Konrad K. Dabrowski Daniël Paulusma
+	Induced Disjoint Paths in Claw-Free Graphs	2015	Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Few Induced Disjoint Paths for H-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen

Works Cited by This (14)

Action	Title	Year	Authors
+	Induced disjoint paths in circular-arc graphs in linear time	2016	Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen
+	On maximal independent sets of vertices in claw-free graphs	1980	George J. Minty
+	Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile	1980	Najiba Sbihi
+	Detecting induced subgraphs	2009	Benjamin Lévêque David Y. Lin Frédéric Maffray Nicolas Trotignon
+	A new characterization of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs	2008	Pim van ’t Hof Daniël Paulusma
+ PDF Chat	The (theta, wheel)-free graphs Part IV: Induced paths and cycles	2020	Marko Radovanović Nicolas Trotignon Kristina Vušković
+	Finding large induced sparse subgraphs in <i> c <sub>>t</sub> </i> -free graphs in quasipolynomial time	2021	Peter Gartland Daniel Lokshtanov Marcin Pilipczuk Michał Pilipczuk Paweł Rzążewski
+	The Robertson-Seymour theorems: a survey of applications	1989	Michael R. Fellows
+ PDF Chat	Few Induced Disjoint Paths for H-Free Graphs	2022	Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen
+ PDF Chat	The k-in-a-Path Problem for Claw-free Graphs	2010	Jiřı́ Fiala Marcin Kamiński Bernard Lidický Daniël Paulusma