scientific article; zbMATH DE number 512967

zbMATH Open0942.68648MaRDI QIDQ4281679FDOQ4281679

Authors: Stefan Arnborg, Andrzej Proskurowski, Detlef Seese 

Publication date: 14 August 2000

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (13)

• \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
• On computing graph minor obstruction sets
• An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion
• A quartic kernel for pathwidth-one vertex deletion
• Minor‐order obstructions for the graphs of vertex cover 6
• Obtaining a planar graph by vertex deletion
• The complexity of subgraph isomorphism for classes of partial k-trees
• The Northwest corner rule revisited
• Parameterized complexity of vertex splitting to pathwidth at most 1
• Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
• A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
• An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
• Faster algorithm for pathwidth one vertex deletion

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281679)