李恒哲｜河南师范大学｜学者主页

2026

The oriented diameter of mixed multigraphs with diameter 2

Zhiwei Ding, Hengzhe Li, Gaoxing Sun

Discrete Mathematics

DOI

2025

The structure of 2-matching connected graphs

Hengzhe Li, Meng-Han Ma, Shuli Zhao, Jianbing Liu

Discussiones Mathematicae Graph Theory

DOI

2025

Complexity and Algorithm for the Matching vertex-cutset Problem

Hengzhe Li, Qiong Wang, Jianbing Liu, Yan-Hong Gao

arXiv.org

DOI

2025

Diameter Three Orientability of Mixed Bipartite Graphs

Hengzhe Li, Zhiwei Ding, Jianbing Liu, An Chang

Graphs and Combinatorics

DOI

2025

The matching-connectivity of a graph

Hengzhe Li, Meng-Han Ma, Shuli Zhao, Xiao Zhao, Xiaohui Hua, Yingbin Ma, Hong-Jian Lai

Discrete Applied Mathematics

DOI

2024

Addible edges in 2-matching-connected graphs and 3-matching-connected graphs

Hengzhe Li, Meng-Han Ma, Jianbing Liu, Xiao Zhao

Discrete Applied Mathematics

DOI

2024

A Note on Improved Bounds for the Oriented Radius of Mixed Multigraphs

Hengzhe Li, Zhiwei Ding, Jianbing Liu, Yan-Hong Gao, Shuli Zhao

Journal of Graph Theory

DOI

2024

Nordhaus–Gaddum-Type Results on the Connected Edge Domination Number

Hengzhe Li, Huayue Liu, Jianbing Liu

Bulletin of the Malaysian Mathematical Sciences Society

DOI

2024

Diameter two orientability of mixed graphs

Hengzhe Li, Zhiwei Ding, Jianbing Liu, Hong-Jian Lai

Discrete Mathematics

DOI

2024

The K1,2-structure-connectivity of graphs

Xiao Zhao, Hao-Jie Zheng, Hengzhe Li

Journal of Supercomputing

DOI

2024

On the minimum size of graphs with given generalized connectivity

Shu-Li Zhao, Hengzhe Li, Jou-Ming Chang

Discrete Applied Mathematics

DOI

2023

2-(Edge-)Connected Edge Domination Number and Matching Number

Hengzhe Li, Ankang Wei, Shenggui Zhang

Graphs and Combinatorics

DOI

2023

Edge-Disjoint Steiner Trees and Connectors in Graphs

Hengzhe Li, Huayue Liu, Jianbing Liu, Yaping Mao

Graphs and Combinatorics

DOI

2023

The λ4-Connectivity of the Cartesian Product of Trees

Hengzhe Li, Jiajia Wang, Rong‐Xia Hao

Journal of Interconnection Networks

DOI

2022

Total Rainbow Connection Number of Some Graph Operations

Hengzhe Li, Yingbin Ma, Yan Zhao

Axioms

DOI

2020

The κk -connectivity of line graphs

Hengzhe Li, Yuanyuan Lu, Baoyindureng Wu, Ankang Wei

Discrete Applied Mathematics

DOI

2019

The vertex- rainbow connection number of some graph operations

Xueliang Li, Hengzhe Li, Yingbin Ma

Discussiones Mathematicae Graph Theory

DOI

2018

The λ3-connectivity and κ3-connectivity of recursive circulants

Hengzhe Li, Jiajia Wang

Applied Mathematics and Computation

DOI

2018

Steiner tree packing number and tree connectivity

Hengzhe Li, Baoyindureng Wu, Jixiang Meng, Yingbin Ma

Discrete Mathematics

DOI

2018

On the Steiner 4-Diameter of Graphs

Zhao Wang, Yaping Mao, Hengzhe Li, Chengfu Ye

Journal of Interconnection Networks

DOI

2018

Making a dominating set of a graph connected

Hengzhe Li, Baoyindureng Wu, Weihua Yang A

Discussiones Mathematicae Graph Theory

DOI

2017

Rainbow connection number and graph operations

Hengzhe Li, Yingbin Ma

Discrete Applied Mathematics

DOI

2017

Graphs with small total rainbow connection number

Yingbin Ma, Lily Chen, Hengzhe Li

Frontiers of Mathematics

DOI

2017

On Tight Bounds for the k-Forcing Number of a Graph

Yan Zhao, Lily Chen, Hengzhe Li

Bulletin of the Malaysian Mathematical Sciences Society

DOI

2016

The generalized 3-connectivity of graph products

Hengzhe Li, Yingbin Ma, Weihua Yang A, Yifei Wang

Applied Mathematics and Computation

DOI

2016

Algorithm on rainbow connection for maximal outerplanar graphs

Xingchao Deng, Hengzhe Li, Guiying Yan

Theoretical Computer Science

DOI

2014

Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees

Weihua Yang A, Hengzhe Li, Weihua He

International Journal of Computer Mathematics

DOI

2014

2-Edge connected dominating sets and 2-Connected dominating sets of a graph

Hengzhe Li, Yuxing Yang, Baoyindureng Wu

Journal of Combinatorial Optimization

DOI

2014

Oriented diameter and rainbow connection number of a graph

Xiaolong Huang, Hengzhe Li, Xueliang Li, Yuefang Sun

Discrete Mathematics & Theoretical Computer Science

DOI

2013

图的彩虹连通数与距离

李恒哲

《南开大学》

2013

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree

Weihua Yang A, Yingzhi Tian, Hengzhe Li, Hao Li, Xiaofeng Guo

Discrete Applied Mathematics

DOI

2011

由对换树生成的凯莱图的3-额外连通度(英文)

李恒哲，孟吉翔，杨卫华

《新疆大学学报(自然科学版中英文)》

A characterization of minimally connected graphs without 2-clique cutsets

Hengzhe Li, Qiong Wang

Discrete Applied Mathematics

DOI

李恒哲

精选作品

期刊论文

The oriented diameter of mixed multigraphs with diameter 2

The structure of 2-matching connected graphs

Complexity and Algorithm for the Matching vertex-cutset Problem

Diameter Three Orientability of Mixed Bipartite Graphs

The matching-connectivity of a graph

Addible edges in 2-matching-connected graphs and 3-matching-connected graphs

A Note on Improved Bounds for the Oriented Radius of Mixed Multigraphs

Nordhaus–Gaddum-Type Results on the Connected Edge Domination Number

Diameter two orientability of mixed graphs

The K1,2-structure-connectivity of graphs

On the minimum size of graphs with given generalized connectivity

2-(Edge-)Connected Edge Domination Number and Matching Number

Edge-Disjoint Steiner Trees and Connectors in Graphs

The λ4-Connectivity of the Cartesian Product of Trees

Total Rainbow Connection Number of Some Graph Operations

The κk -connectivity of line graphs

The vertex- rainbow connection number of some graph operations

The λ3-connectivity and κ3-connectivity of recursive circulants

Steiner tree packing number and tree connectivity

On the Steiner 4-Diameter of Graphs

Making a dominating set of a graph connected

Rainbow connection number and graph operations

Graphs with small total rainbow connection number

On Tight Bounds for the k-Forcing Number of a Graph

The generalized 3-connectivity of graph products

Algorithm on rainbow connection for maximal outerplanar graphs

Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees

2-Edge connected dominating sets and 2-Connected dominating sets of a graph

Oriented diameter and rainbow connection number of a graph

图的彩虹连通数与距离

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree

由对换树生成的凯莱图的3-额外连通度(英文)

A characterization of minimally connected graphs without 2-clique cutsets

预印本

From Halin's Edge Removability to Matching Removability in $k$-Connected Graphs

Characterization of Equimatchable Even-Regular Graphs

研究方向