Pages that link to "Item:Q1325271"

The following pages link to Graph searching and a min-max theorem for tree-width (Q1325271):

Displaying 50 items.

• Canonical tree-decompositions of finite graphs. II. Essential parts (Q257005) (← links)
• Complexity and monotonicity results for domination games (Q266262) (← links)
• Contraction obstructions for connected graph searching (Q298950) (← links)
• On the monotonicity of process number (Q299059) (← links)
• Jumping robbers in digraphs (Q343927) (← links)
• Canonical tree-decompositions of a graph that display its \(k\)-blocks (Q345066) (← links)
• Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
• Graph minors. XXII. Irrelevant vertices in linkage problems (Q412177) (← links)
• Nordhaus-Gaddum for treewidth (Q412239) (← links)
• Tree-width of hypergraphs and surface duality (Q414640) (← links)
• The dag-width of directed graphs (Q444380) (← links)
• On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
• Criticality for multicommodity flows (Q473104) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• The fast robber on interval and chordal graphs (Q476326) (← links)
• Approximation algorithms for digraph width parameters (Q476883) (← links)
• Capture bounds for visibility-based pursuit evasion (Q482339) (← links)
• Parameterized pursuit-evasion games (Q604466) (← links)
• Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
• Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
• \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
• LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
• Connected tree-width (Q722321) (← links)
• Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
• Lower bounds for treewidth of product graphs (Q741743) (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
• Cops and robber on butterflies and solid grids (Q831728) (← links)
• A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
• Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
• Are there any good digraph width measures? (Q896003) (← links)
• On low tree-depth decompositions (Q897253) (← links)
• On the treewidth of toroidal grids (Q897618) (← links)
• Treewidth lower bounds with brambles (Q926284) (← links)
• Monotonicity of non-deterministic graph searching (Q930888) (← links)
• An annotated bibliography on guaranteed graph searching (Q930895) (← links)
• The pebbling threshold of the square of cliques (Q941367) (← links)
• Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
• Connected graph searching in chordal graphs (Q967304) (← links)
• CSP duality and trees of bounded pathwidth (Q986555) (← links)
• Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
• On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
• Monotony properties of connected visible graph searching (Q999260) (← links)
• Graph searching with advice (Q1008727) (← links)
• Affine systems of equations and counting infinitary logic (Q1014638) (← links)
• Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
• Submodular partition functions (Q1045090) (← links)
• Quickly excluding a forest (Q1179478) (← links)
• Excluding infinite minors (Q1191928) (← links)
• A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
• The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944) (← links)