Bounding the search number of graph products
From MaRDI portal
Publication:5215862
DOI10.5666/KMJ.2019.59.1.175zbMath1432.05087arXiv1604.04509MaRDI QIDQ5215862
Margaret-Ellen Messinger, Grace Power, Nancy E. Clarke
Publication date: 13 February 2020
Full work available at URL: https://arxiv.org/abs/1604.04509
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Achievable sets, brambles, and sparse treewidth obstructions
- Cleaning a network with brushes
- Graph minors. I. Excluding a forest
- The vertex separation number of a graph equals its path-width
- A partial k-arboretum of graphs with bounded treewidth
- Graph searching and a min-max theorem for tree-width
- The vertex separation and search number of a graph
- On search, decision, and the efficiency of polynomial-time algorithms
- Searching and pebbling
- Lower bounds on the pathwidth of some grid-like graphs
- Graph minors. II. Algorithmic aspects of tree-width
- The complexity of searching a graph
- The Pathwidth and Treewidth of Cographs
- Edge Search Number of Cographs in Linear Time
- Eavesdropping games
This page was built for publication: Bounding the search number of graph products