Pages that link to "Item:Q5269161"
From MaRDI portal
The following pages link to Critical elements in combinatorially closed families of graph classes (Q5269161):
Displaying 4 items.
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- Families of graphs closed under taking powers (Q5943040) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)