Pages that link to "Item:Q1586757"
From MaRDI portal
The following pages link to On constructible graphs, infinite bridged graphs and weakly cop-win graphs (Q1586757):
Displaying 12 items.
- Pursuit evasion on infinite graphs (Q343924) (← links)
- Bucolic complexes (Q392957) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Constructible graphs and pursuit (Q2166777) (← links)
- The algebra of metric betweenness. I: Subdirect representation and retraction (Q2372427) (← links)
- On the cop number of generalized Petersen graphs (Q2400572) (← links)
- On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs (Q2497466) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Large classes of infinite k-cop-win graphs (Q3061192) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)
