Pages that link to "Item:Q3522960"
From MaRDI portal
The following pages link to Monotony Properties of Connected Visible Graph Searching (Q3522960):
Displaying 6 items.
- Contraction obstructions for connected graph searching (Q298950) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Monotony properties of connected visible graph searching (Q999260) (← links)
- Monotonicity of Non-deterministic Graph Searching (Q3508552) (← links)