Connected graph searching in chordal graphs
type: Item
instance of: scholarly article
title: Connected graph searching in chordal graphs
zbMATH Open document ID: 1211.05037
author: Nicolas Nisse
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5702578
zbMATH Keywords: graph searching
zbMATH Keywords: treewidth
zbMATH Keywords: chordal graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2008.08.007
OpenAlex ID: W1972027829
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4035355
cites work: Monotonicity in graph searching
cites work: Treewidth for graphs with small chordality
cites work: Fugitive-search games on graphs and related parameters
cites work: Connected Treewidth and Connected Graph Searching
cites work: Q3328583
cites work: On the pathwidth of chordal graphs
cites work: Searching and pebbling
cites work: Treewidth of Chordal Bipartite Graphs
cites work: Recontamination does not help to search a graph
cites work: The complexity of searching a graph
cites work: Characterizations and algorithmic applications of chordal graph embeddings
cites work: Q4159394
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Graph searching and a min-max theorem for tree-width
cites work: Algorithms and Computation
DOI: 10.1016/J.DAM.2008.08.007
description: scientific article; zbMATH DE number 5702578