Hengzhe Li

From MaRDI portal
(Redirected from Person:247915)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A note on improved bounds for the oriented radius of mixed multigraphs
Journal of Graph Theory
2026-03-23Paper
t-linear coloring in graphs with given small lenient-tree-width
Discrete Applied Mathematics
2026-03-19Paper
A characterization of minimally connected graphs without 2-clique cutsets
Discrete Applied Mathematics
2025-11-04Paper
Diameter two orientability of mixed graphs
Discrete Mathematics
2025-09-16Paper
Diameter three orientability of mixed bipartite graphs
Graphs and Combinatorics
2025-08-28Paper
The structure of 2-matching connected graphs
Discussiones Mathematicae. Graph Theory
2025-07-31Paper
Addible edges in 2-matching-connected graphs and 3-matching-connected graphs
Discrete Applied Mathematics
2024-09-26Paper
On the minimum size of graphs with given generalized connectivity
Discrete Applied Mathematics
2024-06-21Paper
Nordhaus-Gaddum-type results on the connected edge domination number
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2024-02-21Paper
Edge-disjoint Steiner trees and connectors in graphs
Graphs and Combinatorics
2023-04-28Paper
2-(edge-)connected edge domination number and matching number
Graphs and Combinatorics
2023-04-24Paper
The generalized 4-connectivity of pancake graphs
Discrete Applied Mathematics
2023-01-11Paper
The vertex-rainbow connection number of some graph operations
Discussiones Mathematicae Graph Theory
2021-02-10Paper
The \(\kappa_k\)-connectivity of line graphs
Discrete Applied Mathematics
2020-08-31Paper
Bounds for Gallai-Ramsey functions and numbers2020-07-08Paper
The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
Applied Mathematics and Computation
2019-11-22Paper
On tight bounds for the \(k\)-forcing number of a graph
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2019-06-17Paper
The generalized 3-connectivity of graph products
Applied Mathematics and Computation
2019-03-27Paper
Making a dominating set of a graph connected
Discussiones Mathematicae Graph Theory
2018-08-10Paper
Steiner tree packing number and tree connectivity
Discrete Mathematics
2018-05-24Paper
The chromatic equivalence class of graph \(\psi_n^3(n-3,1)\).2018-02-09Paper
Conditional connectivity of Cayley graphs generated by transposition trees
Information Processing Letters
2017-11-03Paper
A kind of conditional fault tolerance of (n, k)-star graphs
Information Processing Letters
2017-11-03Paper
Graphs with small total rainbow connection number
Frontiers of Mathematics in China
2017-09-26Paper
Rainbow connection number and graph operations
Discrete Applied Mathematics
2017-08-22Paper
The proper (vertex) connection numbers of cubic graphs2017-07-05Paper
Algorithm on rainbow connection for maximal outerplanar graphs
Theoretical Computer Science
2017-03-16Paper
The Steiner 4-diameter of a graph2017-02-18Paper
Rainbow connection number of graphs with diameter 3
Discussiones Mathematicae Graph Theory
2017-01-23Paper
A kind of conditional vertex connectivity of recursive circulants.
Ars Combinatoria
2016-10-06Paper
The total rainbow connection numbers of cubic graphs2016-07-20Paper
2-edge connected dominating sets and 2-connected dominating sets of a graph
Journal of Combinatorial Optimization
2016-02-23Paper
Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
International Journal of Computer Mathematics
2015-07-30Paper
Note on the generalized connectivity.
(available as arXiv preprint)
2015-04-13Paper
Note on the spanning-tree packing number of lexicographic product graphs
Discrete Mathematics
2015-01-30Paper
Note on minimally \(d\)-rainbow connected graphs
Graphs and Combinatorics
2014-09-19Paper
On extremal graphs with internally disjoint Steiner trees
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2014-08-25Paper
On extremal graphs with internally disjoint Steiner trees
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2014-08-25Paper
Oriented diameter and rainbow connection number of a graph
(available as arXiv preprint)
2014-07-01Paper
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-degree
Discrete Applied Mathematics
2014-03-27Paper
The generalized 3-connectivity of Cartesian product
(available as arXiv preprint)
2014-03-25Paper
The generalized 3-connectivity of Cartesian product2014-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 trees
Discrete Mathematics
2012-10-16Paper
3-extra connectivity of Cayley graphs generated by transposition generating trees
Journal of Xinjiang University. Natural Science
2012-10-05Paper
The (strong) rainbow connection numbers of Cayley graphs on abelian groups
Computers & Mathematics with Applications
2012-04-22Paper
Rainbow connection of graphs with diameter 2
Discrete Mathematics
2012-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 graphs
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Hengzhe Li