The following pages link to Xavier Marcote (Q932600):
Displayed 48 items.
- Item:Q932600 (redirect page) (← links)
- Monotonicity of the order of \((D;g)\)-cages (Q654223) (← links)
- Diameter, short paths and superconnectivity in digraphs (Q704288) (← links)
- Connectivity of graphs with given girth pair (Q864156) (← links)
- On the restricted connectivity and superconnectivity in graphs with given girth (Q868327) (← links)
- Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs (Q868335) (← links)
- Lower connectivities of regular graphs with small diameter (Q878612) (← links)
- On the connectivity of cages with girth five, six and eight (Q878639) (← links)
- On the connectivity of \((k,g)\)-cages of even girth (Q932601) (← links)
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs (Q932676) (← links)
- Connectivity measures in matched sum graphs (Q952660) (← links)
- Trees having an even or quasi even degree sequence are graceful (Q1001089) (← links)
- On the 3-restricted edge connectivity of permutation graphs (Q1028132) (← links)
- Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter (Q1041803) (← links)
- Using a progressive withdrawal procedure to study superconnectivity in digraphs (Q1394825) (← links)
- The \(k\)-restricted edge-connectivity of a product of graphs (Q1759863) (← links)
- Every cubic cage is quasi 4-connected (Q1810654) (← links)
- On superconnectivity of (\(4, g\))-cages (Q1938884) (← links)
- The \(p\)-restricted edge-connectivity of Kneser graphs (Q2008197) (← links)
- Improving bounds on the order of regular graphs of girth 5 (Q2317664) (← 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)
- (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected (Q2569934) (← links)
- New results on the Zarankiewicz problem (Q2643330) (← links)
- Diameter and connectivity of (<i>D; g</i>)-cages (Q3008349) (← links)
- On the connectivity of semiregular cages (Q3057169) (← links)
- (Q3105526) (← links)
- Reliability of interconnection networks modeled by a product of graphs (Q3423877) (← 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)
- (Q3606121) (← links)
- (Q3624955) (← links)
- (Q3625838) (← links)
- (Q3625839) (← links)
- (Q3625840) (← links)
- Edge-superconnectivity of cages (Q4446917) (← links)
- Superconnected digraphs and graphs with small conditional diameters (Q4537622) (← links)
- Diameter vulnerability of iterated line digraphs in terms of the girth (Q4667713) (← links)
- Connectedness of digraphs and graphs under constraints on the conditional diameter (Q4667716) (← links)
- On restricted connectivities of permutation graphs (Q4680413) (← links)
- (Q5396749) (← links)
- All (<i>k</i>;<i>g</i>)‐cages are edge‐superconnected (Q5469128) (← links)
- Sufficient conditions for λ′‐optimality in graphs with girth <i>g</i> (Q5471060) (← links)