On the complexity of some subgraph problems
type: Item
instance of: scholarly article
title: On the complexity of some subgraph problems
zbMATH Open document ID: 1227.05240
author: Andrea Scozzari
author: Fabio Tardella
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5702667
zbMATH Keywords: spanning subgraphs
zbMATH Keywords: chordal graphs
zbMATH Keywords: edge-deletion
zbMATH Keywords: spanning tree
zbMATH Keywords: \(q\)-trees
MaRDI profile type: Publication
full work available at URL: j.dam.2009.04.003
OpenAlex ID: W1974807686
cites work: An Application of Duality to Edge-Deletion Problems
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Q4291429
cites work: Graph Classes: A Survey
cites work: Q5708487
cites work: On spanning 2-trees in a graph
cites work: On the SPANNING \(k\)-TREE problem
cites work: NC algorithms for recognizing chordal graphs and k trees
cites work: The complexity of regular subgraph recognition
cites work: Maximal chordal subgraphs
cites work: The complexity of some edge deletion problems
cites work: Series-parallel subgraphs of planar graphs
cites work: Q3317132
cites work: Complexity classification of some edge modification problems
cites work: Q3836524
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: On simple characterizations of k-trees
cites work: Node-and edge-deletion NP-complete problems
cites work: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
cites work: Edge-Deletion Problems
DOI: 10.1016/J.DAM.2009.04.003
description: scientific article; zbMATH DE number 5702667