Sweeping graphs with large clique number
From MaRDI portal
Publication:1045071
DOI10.1016/J.DISC.2008.05.033zbMATH Open1210.05104OpenAlexW2027568724MaRDI QIDQ1045071FDOQ1045071
Authors: Boting Yang, Danny Dyer, Brian Alspach 
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.05.033
Recommendations
Cites Work
- Searching and pebbling
- Eavesdropping games
- Connected Treewidth and Connected Graph Searching
- Title not available (Why is that?)
- The complexity of searching a graph
- Recontamination does not help to search a graph
- Monotonicity in graph searching
- Searching is not jumping.
- Searching and sweeping graphs: a brief survey
- Algorithms and Computation
- Title not available (Why is that?)
Cited In (18)
- On minimum cost edge searching
- Connected searching of weighted trees
- On-line search in two-dimensional environment
- Algorithms and Computation
- Searching and sweeping graphs: a brief survey
- Searching for an intruder on graphs and their subdivisions
- A linear fixed parameter tractable algorithm for connected pathwidth
- On the monotonicity of process number
- Approximate search strategies for weighted trees
- Connected graph searching
- Finding small-width connected path decompositions in polynomial time
- Three-fast-searchable graphs
- Network decontamination under \(m\)-immunity
- Digraph decompositions and monotonicity in digraph searching
- Connected search for a lazy robber
- Zero-visibility cops and robber and the pathwidth of a graph
- Exclusive graph searching
- Title not available (Why is that?)
This page was built for publication: Sweeping graphs with large clique number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045071)
