Pages that link to "Item:Q1984519"
From MaRDI portal
The following pages link to On the cop number of toroidal graphs (Q1984519):
Displaying 11 items.
- Vertex arboricity of toroidal graphs with a forbidden cycle (Q400411) (← links)
- The pagenumber of toroidal graphs is at most seven (Q1377749) (← links)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
- Chasing a drunk robber in many classes of graphs (Q2105709) (← links)
- (Q3484374) (← links)
- On enumeration of a class of toroidal graphs (Q4634992) (← links)
- Bounding the Cop Number of a Graph by Its Genus (Q5163511) (← links)
- When the Comaximal Graph of a Lattice is Toroidal (Q5360766) (← links)
- On the cop number of graphs of high girth (Q6093134) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
- Improved bounds on the cop number when forbidding a minor (Q6667593) (← links)