How to eliminate a graph

DOI10.1007/978-3-642-34611-8_32MaRDI QIDQ5200518zbMATH OpenOpenAlexFDO

Authors Petr A. Golovach, Pinar Heggernes, Pim Van 't Hof, Fredrik Manne, Daniël Paulusma, Michał Pilipczuk

Publication date 6 November 2012

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34611-8_32

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Modifying a graph using vertex elimination
• scientific article; zbMATH DE number 1145349
• Vertex deletion on split graphs: beyond 4-hitting set
• Quadratic vertex kernel for split vertex deletion
• Quadratic vertex kernel for split vertex deletion

Cited in

(4)

• Modifying a graph using vertex elimination
• How to Guard a Graph?
• How to Burn a Graph
• On the Parameterized Complexity of Clique Elimination Distance

This page was built for publication: How to eliminate a graph

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