Pages that link to "Item:Q5265407"

The following pages link to The Cops and Robber game on graphs with forbidden (induced) subgraphs (Q5265407):

Displayed 13 items.

• Study of a combinatorial game in graphs through linear programming (Q1986957) ‎ (← links)
• The game of cops and robbers on directed graphs with forbidden subgraphs (Q2155657) ‎ (← links)
• Cops and robbers on graphs with a set of forbidden induced subgraphs (Q2196576) ‎ (← links)
• Cops that surround a robber (Q2197471) ‎ (← links)
• The one-cop-moves game on graphs with some special structures (Q2210510) ‎ (← links)
• Cops and robbers on \(2K_2\)-free graphs (Q2237234) ‎ (← links)
• An application of the Gyárfás path argument (Q2319714) ‎ (← links)
• Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) ‎ (← links)
• On the hat guessing number of a planar graph class (Q2673483) ‎ (← links)
• Cops and robber on subclasses of \(P_5\)-free graphs (Q2699919) ‎ (← links)
• Cops and robber on some families of oriented graphs (Q5896831) ‎ (← links)
• Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) ‎ (← links)
• (Q6165484) ‎ (← links)