The following pages link to Csaba Király (Q251528):
Displaying 21 items.
- Balanced generic circuits without long paths (Q442309) (← links)
- Generic global rigidity of body-hinge frameworks (Q905896) (← links)
- On packing spanning arborescences with matroid constraint (Q1689956) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Strongly rigid tensegrity graphs on the line (Q1949123) (← links)
- Sufficient conditions for the global rigidity of periodic graphs (Q2066299) (← links)
- Sparse graphs and an augmentation problem (Q2118121) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819) (← links)
- Rigid realizations of graphs with few locations in the plane (Q2662792) (← links)
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\) (Q2692732) (← links)
- On Maximal Independent Arborescence Packing (Q2832576) (← links)
- (Q4413192) (← links)
- (Q4556058) (← links)
- (Q4813279) (← links)
- Sparse Graphs and an Augmentation Problem (Q5041749) (← links)
- Globally Rigid Augmentation of Rigid Graphs (Q5043054) (← links)
- On packing spanning arborescences with matroid constraint (Q5110654) (← links)
- On minimally highly vertex-redundantly rigid graphs (Q5964987) (← links)
- Count and cofactor matroids of highly connected graphs (Q6196151) (← links)