Pages that link to "Item:Q1752455"
From MaRDI portal
The following pages link to On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455):
Displaying 4 items.
- An order approach for the core maintenance problem on edge-weighted graphs (Q2151388) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
- First-order logic axiomatization of metric graph theory (Q6196830) (← links)
