The following pages link to Hebert Pérez-Rosés (Q283698):
Displaying 32 items.
- Mixed Moore Cayley graphs (Q283700) (← links)
- Searching for large multi-loop networks (Q283713) (← links)
- A revised Moore bound for mixed graphs (Q284732) (← links)
- The maximum degree and diameter-bounded subgraph in the mesh (Q444444) (← links)
- Degree diameter problem on honeycomb networks (Q477344) (← links)
- A Moore-like bound for mixed abelian Cayley graphs (Q510563) (← links)
- A variant of the McKay-Miller-Širáň construction for mixed graphs (Q510565) (← links)
- The fine structure of octahedron-free graphs (Q631642) (← links)
- Complexity of graph self-assembly in accretive systems and self-destructible systems (Q633697) (← links)
- Certain extensions of \((l,m\mid n,k)\)-groups. (Q1430478) (← links)
- Computing transformation semigroups (Q1599539) (← links)
- Eulogy for Professor Mirka Miller (1949--2016) (Q1616156) (← links)
- Sixty years of network reliability (Q1616159) (← links)
- Minimal but inefficient presentations of the semi-direct products of some monoids. (Q1864474) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Greedy routing in circulant networks (Q2127722) (← links)
- The maximum degree \& diameter-bounded subgraph and its applications (Q2392540) (← links)
- Iterated endorsement deduction and ranking (Q2398111) (← links)
- The degree/diameter problem for mixed abelian Cayley graphs (Q2403806) (← links)
- Construction of extremal mixed graphs of diameter two (Q2420424) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- The inverse Voronoi problem in graphs. II: Trees (Q2663704) (← links)
- Characterizing the normal forms of a finitely presented monoid (Q2771350) (← links)
- Enumerating words in finitely presented monoids (Q2783477) (← links)
- Fitting Voronoi Diagrams to Planar Tesselations (Q2870041) (← links)
- New largest known graphs of diameter 6 (Q3057089) (← links)
- New Largest Graphs of Diameter 6 (Q3439429) (← links)
- (Q3623848) (← links)
- Complete presentations of Coxeter groups. (Q4449129) (← links)
- Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey (Q5177046) (← links)
- Totally Greedy Sequences Defined by Second-Order Linear Recurrences With Constant Coefficients (Q6730160) (← links)
- Greedy Sets and Greedy Numerical Semigroups (Q6758107) (← links)
