Graph searching and a min-max theorem for tree-width
type: Item
instance of: scholarly article
title: Graph searching and a min-max theorem for tree-width
zbMATH Open document ID: 0795.05110
author: Robin Thomas
author: Paul Seymour
published in: Journal of Combinatorial Theory. Series B
publication date: 1994-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 572455
zbMATH Keywords: graph searching
zbMATH Keywords: min-max theorem
zbMATH Keywords: tree-decomposition
zbMATH Keywords: screens
zbMATH Keywords: game
zbMATH Keywords: tree-width
MaRDI profile type: Publication
full work available at URL: jctb.1993.1027
OpenAlex ID: W2011911122
Wikidata QID: Q29013944
DOI: 10.1006/JCTB.1993.1027
Recommended article: Q4035355
Recommended article: Connected Treewidth and Connected Graph Searching
Recommended article: Tree-Width and Optimization in Bounded Degree Graphs
Recommended article: Graph minors. II. Algorithmic aspects of tree-width
Recommended article: Q4838483
Recommended article: Nondeterministic graph searching: from pathwidth to treewidth
Recommended article: Mathematical Foundations of Computer Science 2005
Recommended article: Graph searching, elimination trees, and a generalization of bandwidth
Recommended article: Graph-Theoretic Concepts in Computer Science
Recommended article: On the maximum cardinality search lower bound for treewidth
description: scientific article; zbMATH DE number 572455