Pages that link to "Item:Q3300761"
From MaRDI portal
The following pages link to Cops and Robbers on Graphs of Bounded Diameter (Q3300761):
Displaying 11 items.
- Cops and Robbers on diameter two graphs (Q482211) (← links)
- The impact of loops on the game of cops and robbers on graphs (Q1712543) (← links)
- A note on cops and robbers, independence number, domination number and diameter (Q2092403) (← links)
- Cops and robbers on graphs with a set of forbidden induced subgraphs (Q2196576) (← links)
- A partition approach to lower bounds for zero-visibility cops and robber (Q2301762) (← links)
- On the Capture Time of Cops and Robbers Game on a Planar Graph (Q2958299) (← links)
- Cops and Robbers on String Graphs (Q3459875) (← links)
- Cops and Robbers on Planar‐Directed Graphs (Q4596319) (← links)
- (Q4598376) (← links)
- The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
- A note on hyperopic cops and robber (Q6174757) (← links)