Yanmei Hong

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Highly connected triples and Mader's conjecture	2024-11-24	Paper
Gallai's conjecture for 3-degenerated graphs	2024-05-21	Paper
Mader's conjecture for graphs with small connectivity	2023-10-05	Paper
Connectivity keeping trees in 3-connected or 3-edge-connected graphs	2023-10-04	Paper
Connectivity keeping caterpillars and spiders in 2-connected graphs	2021-01-27	Paper
Edge decomposition of connected claw-free cubic graphs	2020-07-07	Paper
The reliability of lexicographic product digraphs	2019-12-12	Paper
The Erd\"os-S\'os Conjecture for Spiders	2018-04-18	Paper
Degree sequence for \(k\)-arc strongly connected multiple digraphs	2017-10-27	Paper
Characterization of Digraphic Sequences with Strongly Connected Realizations	2017-02-01	Paper
Fractional spanning tree packing, forest covering and eigenvalues	2016-09-12	Paper
Ore-type degree condition of supereulerian digraphs	2016-05-18	Paper
Realizability of fault-tolerant graphs	2016-04-04	Paper
Nonseparating Cycles Avoiding Specific Vertices	2016-02-01	Paper
A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph	2015-03-30	Paper
Ore's condition for completely independent spanning trees	2014-09-08	Paper
Note on edge-disjoint spanning trees and eigenvalues	2014-07-22	Paper
Supereulerian digraphs	2014-06-25	Paper
Edge-disjoint spanning trees and eigenvalues	2014-04-02	Paper
Non-separating subgraphs	2013-03-01	Paper
Backup 2-center on interval graphs	2012-08-10	Paper
Edge fault tolerance of graphs with respect to super edge connectivity	2012-05-04	Paper
Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs	2010-09-01	Paper
Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs	2009-12-10	Paper
Minimally 3-restricted edge connected graphs	2009-06-30	Paper
Minimally restricted edge connected graphs	2008-11-06	Paper

Research outcomes over time

This page was built for person: Yanmei Hong