Pages that link to "Item:Q1410688"
From MaRDI portal
The following pages link to Constructive characterizations for packing and covering with trees (Q1410688):
Displayed 12 items.
- An inductive construction of minimally rigid body-hinge simple graphs (Q300212) (← links)
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid (Q404444) (← links)
- The constructive characterization of \((k,l)\)-edge-connected digraphs (Q653995) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- On constructive characterizations of \((k,l)\)-sparse graphs (Q852713) (← links)
- \(\ell^1\) and \(\ell^\infty\) plane (Q2188841) (← links)
- Graph rigidity for unitarily invariant matrix norms (Q2207654) (← links)
- Sufficient conditions for the global rigidity of graphs (Q2347845) (← links)
- Pebble game algorithms and sparse graphs (Q2476285) (← links)
- An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs (Q2867117) (← links)
- The Steiner Problem for Count Matroids (Q5041203) (← links)
- One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory (Q5261889) (← links)