The following pages link to Hengzhe Li (Q247915):
Displaying 41 items.
- On extremal graphs with internally disjoint Steiner trees (Q400783) (← links)
- Rainbow connection of graphs with diameter 2 (Q408184) (← links)
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees (Q456645) (← links)
- Rainbow connection number of graphs with diameter 3 (Q503673) (← links)
- Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
- Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- A kind of conditional fault tolerance of \((n, k)\)-star graphs (Q1675782) (← links)
- Conditional connectivity of Cayley graphs generated by transposition trees (Q1675816) (← links)
- The generalized 3-connectivity of graph products (Q1734731) (← links)
- Steiner tree packing number and tree connectivity (Q1752665) (← links)
- The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants (Q2007586) (← links)
- The generalized 4-connectivity of pancake graphs (Q2112653) (← links)
- The \(\kappa_k\)-connectivity of line graphs (Q2197398) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- Graphs with small total rainbow connection number (Q2405975) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- The (strong) rainbow connection numbers of Cayley graphs on abelian groups (Q2429053) (← links)
- The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree (Q2440128) (← links)
- Note on the spanning-tree packing number of lexicographic product graphs (Q2514151) (← links)
- 2-(edge-)connected edge domination number and matching number (Q2698534) (← links)
- Edge-disjoint Steiner trees and connectors in graphs (Q2701394) (← links)
- (Q2823193) (← links)
- (Q2918370) (← links)
- (Q3134338) (← links)
- Graphs with large generalized 3-connectivity (Q4982923) (← links)
- Oriented diameter and rainbow connection number of a graph (Q5167722) (← links)
- Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees (Q5266134) (← links)
- (Q5273091) (← links)
- The generalized 3-connectivity of Cartesian product graphs (Q5403014) (← links)
- (Q5741008) (← links)
- 2-edge connected dominating sets and 2-connected dominating sets of a graph (Q5963646) (← links)
- Nordhaus-Gaddum-type results on the connected edge domination number (Q6202040) (← links)
- The $K_{1,2}$-structure-connectivity of graphs (Q6525538) (← links)
- On the minimum size of graphs with given generalized connectivity (Q6559394) (← links)
- Addible edges in 2-matching-connected graphs and 3-matching-connected graphs (Q6611027) (← links)
- A Note on Improved bounds for the Oriented Radius of Mixed Multigraphs (Q6734747) (← links)
- Diameter two orientability of mixed graphs (Q6741098) (← links)
- Characterization of Equimatchable Even-Regular Graphs (Q6742052) (← links)
- Complexity and Algorithm for the Matching vertex-cutset Problem (Q6764233) (← links)
