The following pages link to Yanmei Hong (Q262984):
Displaying 25 items.
- Realizability of fault-tolerant graphs (Q262985) (← links)
- Ore-type degree condition of supereulerian digraphs (Q284720) (← links)
- Fractional spanning tree packing, forest covering and eigenvalues (Q313822) (← links)
- Ore's condition for completely independent spanning trees (Q406328) (← links)
- Edge fault tolerance of graphs with respect to super edge connectivity (Q412367) (← links)
- Backup 2-center on interval graphs (Q442280) (← links)
- Edge decomposition of connected claw-free cubic graphs (Q777388) (← links)
- Minimally restricted edge connected graphs (Q953882) (← links)
- Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs (Q990947) (← links)
- Minimally 3-restricted edge connected graphs (Q1028461) (← links)
- Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs (Q1043973) (← links)
- Non-separating subgraphs (Q1937549) (← links)
- Supereulerian digraphs (Q2017061) (← links)
- Connectivity keeping caterpillars and spiders in 2-connected graphs (Q2222940) (← links)
- Note on edge-disjoint spanning trees and eigenvalues (Q2250921) (← links)
- The reliability of lexicographic product digraphs (Q2279382) (← links)
- Degree sequence for \(k\)-arc strongly connected multiple digraphs (Q2412864) (← links)
- Edge-disjoint spanning trees and eigenvalues (Q2442253) (← links)
- Characterization of Digraphic Sequences with Strongly Connected Realizations (Q2958207) (← links)
- Nonseparating Cycles Avoiding Specific Vertices (Q3466341) (← links)
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
- Connectivity keeping trees in 3-connected or 3-edge-connected graphs (Q6056744) (← links)
- Mader's conjecture for graphs with small connectivity (Q6057633) (← links)
- Gallai's conjecture for 3-degenerated graphs (Q6542059) (← links)
- Highly connected triples and Mader's conjecture (Q6642502) (← links)
