Sweeping graphs with large clique number

DOI10.1016/J.DISC.2008.05.033MaRDI QIDQ1045071zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clique numberedge searchingsweeping

Mathematics Subject Classification ID

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

Recommendations

• Searching and sweeping graphs: a brief survey
• Algorithms and Computation
• Lower Bounds on Edge Searching
• Search and sweep numbers of finite directed acyclic graphs
• Three-fast-searchable graphs

Cites work

• Algorithms and Computation
• Connected Treewidth and Connected Graph Searching
• Eavesdropping games
• scientific article; zbMATH DE number 4037592 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• Monotonicity in graph searching
• Recontamination does not help to search a graph
• Searching and pebbling
• Searching and sweeping graphs: a brief survey
• Searching is not jumping.
• The complexity of searching a graph

Cited in

(19)

• Approximate search strategies for weighted trees
• Searching for an intruder on graphs and their subdivisions
• Finding small-width connected path decompositions in polynomial time
• Zero-visibility cops and robber and the pathwidth of a graph
• Three-fast-searchable graphs
• On the monotonicity of process number
• Searching and sweeping graphs: a brief survey
• On minimum cost edge searching
• A linear fixed parameter tractable algorithm for connected pathwidth
• Exclusive graph searching
• Algorithms and Computation
• On-line search in two-dimensional environment
• Connected search for a lazy robber
• scientific article; zbMATH DE number 7746012 (Why is no real title available?)
• Digraph decompositions and monotonicity in digraph searching
• Connected graph searching
• Further results on the hunters and rabbit game through monotonicity
• Connected searching of weighted trees
• Network decontamination under m-immunity

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)