Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Yanmei Hong
Observed name:
Hong, Yanmei
Institution:
Fuzhou University
Observed institutions:
Shanghai University,
Fujian Science and Technology Innovation Laboratory for Optoelectronic Information of China,
Fuzhou University,
Xinjiang University
OpenAlex ID:
A5020180938
Ore’s condition for completely independent spanning trees
2014
·
Genghua Fan
, Yanmei Hong
, et al.
·
Discrete Applied Mathematics
·
61
PDF
Note on edge-disjoint spanning trees and eigenvalues
2014
·
Qinghai Liu
, Yanmei Hong
, et al.
·
Linear Algebra and its Applications
·
37
PDF
Edge-disjoint spanning trees and eigenvalues
2013
·
Qinghai Liu
, Yanmei Hong
, et al.
·
Linear Algebra and its Applications
·
27
PDF
Supereulerian digraphs
2014
·
Yanmei Hong
, Hong-Jian Lai
, et al.
·
Discrete Mathematics
·
24
PDF
On the Spectra of Unicyclic Graphs
1986
·
Yanmei Hong
·
Journal of Shanghai Normal University
·
23
Edge fault tolerance of graphs with respect to super edge connectivity
2011
·
Yanmei Hong
, Jixiang Meng
, et al.
·
Discrete Applied Mathematics
·
21
PDF
Ore-type degree condition of supereulerian digraphs
2016
·
Yanmei Hong
, Qinghai Liu
, et al.
·
Discrete Mathematics
·
15
Connectivity keeping caterpillars and spiders in 2-connected graphs
2020
·
Yanmei Hong
, Qinghai Liu
, et al.
·
Discrete Mathematics
·
14
Mader's conjecture for graphs with small connectivity
2022
·
Yanmei Hong
, Qinghai Liu
·
Journal of Graph Theory
·
13
PDF
Fractional spanning tree packing, forest covering and eigenvalues
2016
·
Yanmei Hong
, Xiaofeng Gu
, et al.
·
Discrete Applied Mathematics
·
12
Minimally restricted edge connected graphs
2007
·
Yanmei Hong
, Qinghai Liu
, et al.
·
Applied Mathematics Letters
·
10
Edge decomposition of connected claw-free cubic graphs
2020
·
Yanmei Hong
, Qinghai Liu
, et al.
·
Discrete Applied Mathematics
·
6
A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph
2012
·
Qinghai Liu
, Zhao Zhang
, et al.
·
Springer optimization and its applications
·
6
Vertex fault tolerance of optimal-κ graphs and super-κ graphs
2009
·
Yanmei Hong
, Zhao Zhang
·
Information Processing Letters
·
5
Highly connected triples and Mader's conjecture
2024
·
Qinghai Liu
, Kai Ying
, et al.
·
Journal of Graph Theory
·
4
Connectivity keeping trees in 3-connected or 3-edge-connected graphs
2023
·
Haiyang Liu
, Qinghai Liu
, et al.
·
Discrete Mathematics
·
4
Rooted Spider Embeddings and the Erd\H os-Sós Conjecture
2018
·
Fan, Genghua
, Hong, Yanmei
, et al.
·
arXiv (Cornell University)
·
4
PDF
Backup 2-center on interval graphs
2012
·
Yanmei Hong
, Liying Kang
·
Theoretical Computer Science
·
4
PDF
Characterization of Digraphic Sequences with Strongly Connected Realizations
2016
·
Yanmei Hong
, Qinghai Liu
, et al.
·
Journal of Graph Theory
·
3
Nonseparating Cycles Avoiding Specific Vertices
2014
·
Yanmei Hong
, Liying Kang
, et al.
·
Journal of Graph Theory
·
3
Minimally 3-restricted edge connected graphs
2008
·
Qinghai Liu
, Yanmei Hong
, et al.
·
Discrete Applied Mathematics
·
3
Connectivity keeping pendant extensions of paths in $k$-connected triangle-free graphs
2026
·
Ma, Menghan
, Liu, Qinghai
, et al.
·
arXiv (Cornell University)
·
1
PDF
Redundant Trees in Bipartite Graphs
2025
·
Yanmei Hong
, Yihong Wu
, et al.
·
Mathematics
·
1
Gallai's conjecture for 3-degenerated graphs
2024
·
Junhao Zhang
, Qinghai Liu
, et al.
·
Discrete Mathematics
·
1
Realizability of Fault-Tolerant Graphs
2015
·
Yanmei Hong
·
Bulletin of the Malaysian Mathematical Sciences Society
·
1
Show more works
View as search
Works count:
33
Citation count:
304
H-index:
10
I10-index:
11
Year
Topic
Type
