Hengzhe Li

From MaRDI portal
Person:247915

Available identifiers

zbMath Open li.hengzheMaRDI QIDQ247915

List of research outcomes





PublicationDate of PublicationType
Addible edges in 2-matching-connected graphs and 3-matching-connected graphs2024-09-26Paper
On the minimum size of graphs with given generalized connectivity2024-06-21Paper
Nordhaus-Gaddum-type results on the connected edge domination number2024-02-21Paper
Edge-disjoint Steiner trees and connectors in graphs2023-04-28Paper
2-(edge-)connected edge domination number and matching number2023-04-24Paper
The generalized 4-connectivity of pancake graphs2023-01-11Paper
The vertex-rainbow connection number of some graph operations2021-02-10Paper
The \(\kappa_k\)-connectivity of line graphs2020-08-31Paper
Bounds for Gallai-Ramsey functions and numbers2020-07-08Paper
The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants2019-11-22Paper
On tight bounds for the \(k\)-forcing number of a graph2019-06-17Paper
The generalized 3-connectivity of graph products2019-03-27Paper
Making a dominating set of a graph connected2018-08-10Paper
Steiner tree packing number and tree connectivity2018-05-24Paper
https://portal.mardi4nfdi.de/entity/Q31343382018-02-09Paper
Conditional connectivity of Cayley graphs generated by transposition trees2017-11-03Paper
A kind of conditional fault tolerance of \((n, k)\)-star graphs2017-11-03Paper
Graphs with small total rainbow connection number2017-09-26Paper
Rainbow connection number and graph operations2017-08-22Paper
https://portal.mardi4nfdi.de/entity/Q52730912017-07-05Paper
Algorithm on rainbow connection for maximal outerplanar graphs2017-03-16Paper
The Steiner 4-diameter of a graph2017-02-18Paper
Rainbow connection number of graphs with diameter 32017-01-23Paper
A kind of conditional vertex connectivity of recursive circulants.2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q57410082016-07-20Paper
2-edge connected dominating sets and 2-connected dominating sets of a graph2016-02-23Paper
Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees2015-07-30Paper
Graphs with large generalized 3-connectivity2015-04-13Paper
Note on the spanning-tree packing number of lexicographic product graphs2015-01-30Paper
Note on minimally \(d\)-rainbow connected graphs2014-09-19Paper
On extremal graphs with internally disjoint Steiner trees2014-08-25Paper
Oriented diameter and rainbow connection number of a graph2014-07-01Paper
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree2014-03-27Paper
The generalized 3-connectivity of Cartesian product graphs2014-03-25Paper
Lower bounds for the spanning tree numbers of two graph products2013-07-09Paper
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees2012-10-16Paper
3-extra connectivity of Cayley graphs generated by transposition generating trees2012-10-05Paper
The (strong) rainbow connection numbers of Cayley graphs on abelian groups2012-04-22Paper
Rainbow connection of graphs with diameter 22012-03-29Paper
Upper bound for the rainbow connection number of bridgeless graphs with diameter 32011-09-13Paper
Note on the oriented diameter of graphs with diameter 32011-09-06Paper
Asymptotic value of the minimal size of a graph with rainbow connection number 22011-05-22Paper
The $K_{1,2}$-structure-connectivity of graphsN/APaper

Research outcomes over time

This page was built for person: Hengzhe Li