Sweeping graphs with large clique number

DOI10.1016/j.disc.2008.05.033zbMath1210.05104OpenAlexW2027568724MaRDI QIDQ1045071

Danny Dyer, Brian Alspach, Boting Yang

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

zbMATH Keywords

sweepingclique numberedge searching

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On the monotonicity of process number, A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth, Searching for an intruder on graphs and their subdivisions, On minimum cost edge searching, Approximate search strategies for weighted trees, Connected search for a lazy robber, Network decontamination under \(m\)-immunity, Digraph decompositions and monotonicity in digraph searching, Three-fast-searchable graphs, Exclusive graph searching, Connected graph searching, Connected searching of weighted trees, On-line search in two-dimensional environment, Searching by heterogeneous agents, Finding small-width connected path decompositions in polynomial time, Zero-visibility cops and robber and the pathwidth of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching and pebbling
• Connected Treewidth and Connected Graph Searching
• The complexity of searching a graph
• Monotonicity in graph searching
• Recontamination does not help to search a graph
• Eavesdropping games
• Algorithms and Computation
• Graph-Theoretic Concepts in Computer Science