The following pages link to Camino Balbuena (Q270264):
Displayed 50 items.
- Using a progressive withdrawal procedure to study superconnectivity in digraphs (Q1394825) (← links)
- Edge-connectivity and super edge-connectivity of \(P_{2}\)-path graphs (Q1402063) (← links)
- Vertex disjoint 4-cycles in bipartite tournaments (Q1699558) (← links)
- The \(k\)-restricted edge-connectivity of a product of graphs (Q1759863) (← links)
- Elliptic semiplanes and regular graphs with girth 5 (Q1792108) (← links)
- Rainbow connectivity of Moore cages of girth 6 (Q1801053) (← links)
- Every cubic cage is quasi 4-connected (Q1810654) (← links)
- Edge-connectivity in \(P_k\)-path graphs (Q1887639) (← links)
- On superconnectivity of (\(4, g\))-cages (Q1938884) (← links)
- On second order degree of graphs (Q1943026) (← links)
- A note on the upper bound and girth pair of (\(k;g\))-cages (Q1946230) (← links)
- Biregular cages of girth five (Q1953464) (← links)
- The \(p\)-restricted edge-connectivity of Kneser graphs (Q2008197) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Identifying codes in line digraphs (Q2189840) (← links)
- About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs (Q2312064) (← links)
- Improving bounds on the order of regular graphs of girth 5 (Q2317664) (← links)
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments (Q2333161) (← links)
- A construction of small \((q-1)\)-regular graphs of girth 8 (Q2341056) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- On the acyclic disconnection and the girth (Q2345594) (← links)
- On a conjecture on the order of cages with a given girth pair (Q2352778) (← links)
- A sufficient condition for \(P_{k}\)-path graphs being \(r\)-connected (Q2381537) (← links)
- Edge-connectivity and edge-superconnectivity in sequence graphs (Q2384389) (← links)
- New small regular graphs of girth 5 (Q2397530) (← links)
- Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
- On the order of \((\{r,m\};g)\)-cages of even girth (Q2427507) (← links)
- On the edge-connectivity and restricted edge-connectivity of a product of graphs (Q2462383) (← links)
- Structural properties of CKI-digraphs (Q2512568) (← links)
- Small regular graphs of girth 7 (Q2517652) (← links)
- Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages (Q2568484) (← links)
- (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected (Q2569934) (← links)
- New results on the Zarankiewicz problem (Q2643330) (← links)
- On the Superconnectivity in graphs with odd girth g and even girth h (Q2851513) (← links)
- (Q2857325) (← links)
- Diameter and connectivity of (<i>D; g</i>)-cages (Q3008349) (← links)
- (Q3011766) (← links)
- On the connectivity of semiregular cages (Q3057169) (← links)
- Constructions of small regular bipartite graphs of girth 6 (Q3082600) (← links)
- Edge-superconnectivity of semiregular cages with odd girth (Q3100699) (← links)
- (Q3105526) (← links)
- Reliability of interconnection networks modeled by a product of graphs (Q3423877) (← links)
- Using Gumbel Distribution to determine the distribution for maximum and minimum in the degree sequence (Q3438935) (← links)
- Every Cubic Cage is quasi 4-connected (Q3438985) (← links)
- On extremal bipartite graphs with high girth (Q3439643) (← links)
- Highly connected star product graphs (Q3439647) (← links)
- Extremal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)< (Q3439653) (← links)
- A lower bound on the order of regular graphs with given girth pair (Q3445509) (← links)
- Conditional diameter saturated graphs (Q3548719) (← links)
- (Q3575429) (← links)