The following pages link to Lily Chen (Q274686):
Displayed 24 items.
- Hardness results for total rainbow connection of graphs (Q274688) (← links)
- Bicyclic graphs with maximal edge revised Szeged index (Q323087) (← links)
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076) (← links)
- Further hardness results on the rainbow vertex-connection number of graphs (Q385046) (← links)
- Tricyclic graphs with maximal revised Szeged index (Q406325) (← links)
- A solution to a conjecture on the generalized connectivity of graphs (Q512887) (← links)
- The complexity of determining the rainbow vertex-connection of a graph (Q638512) (← links)
- Strong edge-coloring for planar graphs with large girth (Q1625788) (← links)
- Injective edge coloring of generalized Petersen graphs (Q2130827) (← links)
- The effect of vertex and edge deletion on the edge metric dimension of graphs (Q2168730) (← links)
- The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs (Q2172399) (← links)
- The strong chromatic index of graphs with edge weight eight (Q2185830) (← links)
- The 3-rainbow index of a graph (Q2259571) (← links)
- The strong edge-coloring for graphs with small edge weight (Q2297732) (← links)
- DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
- Graphs with small total rainbow connection number (Q2405975) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- On the \([1,2]\)-domination number of generalized Petersen graphs (Q2424833) (← links)
- The (revised) Szeged index and the Wiener index of a nonbipartite graph (Q2441630) (← links)
- Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph (Q2895393) (← links)
- (Q5273091) (← links)
- (Q5741008) (← links)
- On a relation between the Szeged index and the Wiener index for bipartite graphs (Q6236613) (← links)
- Further hardness results on the generalized connectivity of graphs (Q6241384) (← links)