Pages that link to "Item:Q4210215"
From MaRDI portal
The following pages link to On Distance-Preserving and Domination Elimination Orderings (Q4210215):
Displaying 13 items.
- Characterizations of \(k\)-copwin graphs (Q408176) (← links)
- Edge critical cops and robber (Q708375) (← links)
- A witness version of the cops and robber game (Q1025953) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- Graphs of some CAT(0) complexes (Q1973869) (← links)
- Ambush cops and robbers (Q2053707) (← links)
- Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- Tandem-win graphs (Q2568474) (← links)
- Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
- Graphs with \(G^p\)-connected medians (Q6120939) (← links)
- First-order logic axiomatization of metric graph theory (Q6196830) (← links)
- The complexity of growing a graph (Q6627045) (← links)
