Publication:5900072: Difference between revisions

From MaRDI portal
Publication:5900072
Created automatically from import240129110113
 
m EloiFerrer moved page Detecting induced subgraphs to Detecting induced subgraphs: Duplicate
 
(No difference)

Latest revision as of 13:34, 2 May 2024

DOI10.1016/j.endm.2007.07.036zbMath1341.05169arXiv1309.0971OpenAlexW2180172454MaRDI QIDQ5900072

Benjamin Lévêque, David Y. Lin, Nicolas Trotignon, Frédéric Maffray

Publication date: 5 June 2008

Published in: Discrete Applied Mathematics, Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.0971




Related Items (28)

The four-in-a-tree problem in triangle-free graphsGraph editing to a fixed targetComplete intersection toric ideals of oriented graphs and chorded-theta subgraphsThe \(k\)-in-a-tree problem for graphs of girth at least \(k\)Detecting an induced subdivision of \(K_{4}\)Induced disjoint paths and connected subgraphs for \(H\)-free graphsInduced disjoint paths and connected subgraphs for \(H\)-free graphsMIP formulations for induced graph optimization problems: a tutorialFinding induced paths of given parity in claw-free graphsThe \(k\)-in-a-path problem for claw-free graphsOn graphs with no induced subdivision of \(K_4\)Partial characterizations of circle graphsDetecting an induced net subdivisionFinding an induced subdivision of a digraphStructural results on circular-arc graphs and circle graphs: a survey and the main open problemsThe (theta, wheel)-free graphs. IV: Induced paths and cyclesFinding a subdivision of a digraphCIO and ring graphs: deficiency and testingDetecting fixed patterns in chordal graphs in polynomial timeFinding induced treesFew induced disjoint paths for \(H\)-free graphsInduced Disjoint Paths in Claw-Free GraphsA structure theorem for graphs with no cycle with a unique chord and its consequencesInduced disjoint paths in AT-free graphsClique or hole in claw-free graphsContainment relations in split graphsFew induced disjoint paths for \(H\)-free graphsTreewidth versus Clique Number. I. Graph Classes with a Forbidden Structure




Cites Work




This page was built for publication: Detecting induced subgraphs