On graph contractions and induced minors
type: Item
instance of: scholarly article
title: On graph contractions and induced minors
zbMATH Open document ID: 1241.05137
author: Daniël Paulusma
author: Stefan Szeider
author: Dimitrios M. Thilikos
author: Pim Van 't Hof
author: Marcin Kamiński
published in: Discrete Applied Mathematics
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 6033764
zbMATH Keywords: graph contraction
zbMATH Keywords: graph induced minor
zbMATH Keywords: graph minor
MaRDI profile type: Publication
full work available at URL: j.dam.2010.05.005
OpenAlex ID: W2156209401
cites work: Restricted Mesh Simplification Using Edge Contractions
cites work: A linear time algorithm for finding tree-decompositions of small treewidth
cites work: Contractibility and NP-completeness
cites work: Hierarchy of surface models and irreducible triangulations.
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4393480
cites work: The complexity of induced minors and related problems
cites work: Contraction Bidimensionality: The Accurate Picture
cites work: Q4198056
cites work: Q4474204
cites work: Contraction theorems in Hamiltonian graph theory
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
cites work: The computational complexity of graph contractions II: Two tough polynomially solvable cases
cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Graph minors. XX: Wagner's conjecture
DOI: 10.1016/J.DAM.2010.05.005
description: scientific article; zbMATH DE number 6033764