The following pages link to Yuefang Sun (Q339465):
Displayed 38 items.
- Sharp upper bounds for generalized edge-connectivity of product graphs (Q339466) (← links)
- On rainbow total-coloring of a graph (Q494442) (← links)
- Rainbow connection number of graphs with diameter 3 (Q503673) (← links)
- On the difference of two generalized connectivities of a graph (Q512888) (← links)
- Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
- Upper bounds for the rainbow connection numbers of line graphs (Q1926059) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- On the strong rainbow connection of a graph (Q2376940) (← links)
- (Q2791974) (← links)
- (Q2791975) (← links)
- Generalized 3-(edge)-connectivity for undirected double-loop networks (Q2831803) (← links)
- On the generalized (edge-)connectivity of graphs (Q2876013) (← links)
- Rainbow connection numbers of complementary graphs (Q2895363) (← links)
- Note on the Rainbow $k$-Connectivity of Regular Complete Bipartite Graphs (Q2918575) (← links)
- Characterize graphs with rainbow connection number $m-2$ and $m-3$ (Q2938261) (← links)
- Rainbow Connection Numbers for Undirected Double-Loop Networks (Q2942464) (← links)
- The rainbow $k$-connectivity of two classes of graphs (Q3090479) (← links)
- (Q3166468) (← links)
- Graphs with large generalized 3-connectivity (Q4982923) (← links)
- Oriented diameter and rainbow connection number of a graph (Q5167722) (← links)
- Generalized 3-edge-connectivity of Cartesian product graphs (Q5249649) (← links)
- The generalized 3-connectivity of Cartesian product graphs (Q5403014) (← links)
- Asymptotic value of the minimal size of a graph with rainbow connection number 2 (Q6225560) (← links)
- Note on the oriented diameter of graphs with diameter 3 (Q6227563) (← links)
- Upper bound for the rainbow connection number of bridgeless graphs with diameter 3 (Q6227719) (← links)
- Strong subgraph $k$-connectivity bounds (Q6298411) (← links)
- Strong subgraph $k$-arc-connectivity (Q6301162) (← links)
- Strong Subgraph Connectivity of Digraphs: A Survey (Q6305183) (← links)
- Extremality and Sharp Bounds for the $k$-edge-connectivity of Graphs (Q6312657) (← links)
- Semicomplete Compositions of Digraphs (Q6339913) (← links)
- Kings and Kernels in Semicomplete Compositions (Q6342510) (← links)
- Compositions of Digraphs: A Survey (Q6363326) (← links)
- Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs (Q6388896) (← links)
- Steiner Type Packing Problems in Digraphs: A Survey (Q6403034) (← links)
- Perfect Out-forests and Steiner Cycle Packing in Digraphs (Q6408171) (← links)
- Sharp Bounds and Precise Values for the $N_i$-Chromatic Number of Graphs (Q6408287) (← links)
- A minimum semi-degree condition for unpaired many-to-many disjoint path covers in digraphs (Q6412556) (← links)
- Directed Steiner path packing and directed path connectivity (Q6416487) (← links)