The following pages link to Herman J. Servatius (Q966174):
Displaying 50 items.
- (Q588021) (redirect page) (← links)
- (Q686283) (redirect page) (← links)
- (Q1377842) (redirect page) (← links)
- Groups assembled from free and direct products (Q686284) (← links)
- Henneberg moves on mechanisms (Q747580) (← links)
- Tree groups and the 4-string pure braid group (Q803279) (← links)
- Defining matroids through sequential selection (Q854847) (← links)
- Rigidity theory for matroids (Q863624) (← links)
- Combinatorial pseudo-triangulations (Q864146) (← links)
- Some problems, I care most (Q966175) (← links)
- Rigidity, global rigidity, and graph decomposition (Q973100) (← links)
- An Artin relation of length \(n\) in the braid group (Q1196991) (← links)
- The Duchet conjecture (Q1265355) (← links)
- Connectivity and planarity of Cayley graphs (Q1267323) (← links)
- Reductive enumeration under mutually orthogonal group actions (Q1270635) (← links)
- Weak maps and stabilizers of classes of matroids (Q1271863) (← links)
- Symplectic matroids (Q1272889) (← links)
- On groups \(G^{5,5,180}\) (Q1281273) (← links)
- Higher-order rigidity -- what is the proper definition? (Q1317877) (← links)
- Self-dual maps on the sphere (Q1339872) (← links)
- A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph (Q1349112) (← links)
- Techniques in matroid reconstruction (Q1363660) (← links)
- On packing 3-connected restrictions into 3-connected matroids (Q1377843) (← links)
- On orbital regular graphs and Frobenius graphs (Q1379826) (← links)
- Nonintersecting paths, Pfaffians, and \(\Delta\)-matroids (Q1384031) (← links)
- A note on the asymptotic and computational complexity of graph distinguishability (Q1385847) (← links)
- On maximum-sized near-regular and \(\root 6\of{1}\)-matroids (Q1393031) (← links)
- Domination numbers and homology (Q1395819) (← links)
- Chain decomposition and the flag \(f\)-vector. (Q1399906) (← links)
- Rigidity of graph products of groups. (Q1411959) (← links)
- On the structure of 3-connected matroids and graphs (Q1580678) (← links)
- Analysis of Venn diagrams using cycles in graphs (Q1590670) (← links)
- \(k\)-subdomination in graphs (Q1613364) (← links)
- An inductive definition of cubic toroidal maps (Q1613370) (← links)
- A framework for the greedy algorithm (Q1613405) (← links)
- Non-crossing frameworks with non-crossing reciprocals (Q1764166) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Connected rigidity matroids and unique realizations of graphs (Q1775892) (← links)
- Sign types associated to posets (Q1806212) (← links)
- A class of non-binary matroids with many binary minors (Q1817572) (← links)
- Automorphisms of graph groups. (Q1824033) (← links)
- Perfect graphs of strong domination and independent strong domination (Q1841911) (← links)
- Totally free expansions of matroids. (Q1850582) (← links)
- Branch-width and well-quasi-ordering in matroids and graphs. (Q1850591) (← links)
- Two-dimensional Artin groups with CAT(0) dimension three. (Q1855285) (← links)
- A partitioning and related properties for the quotient complex \(\Delta(B _{lm})/S_{l }S_m\) (Q1861508) (← links)
- Bounds for the chromatic number of graphs with partial information (Q1869218) (← links)
- The 24 symmetry pairings of self-dual maps on the sphere (Q1893173) (← links)
- The structure of locally finite two-connected graphs (Q1899731) (← links)
- Self-dual graphs (Q1910579) (← links)
- On unicyclic graphs with given number of pendent vertices and minimal energy (Q2174094) (← links)
- On the 2-sum in rigidity matroids (Q2275479) (← links)
