Yuefang Sun

Orcid: 0000-0002-7515-8481

According to our database1, Yuefang Sun authored at least 66 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Scattering number of digraphs.
Appl. Math. Comput., April, 2024

Anti-Ramsey number of matchings in outerplanar graphs.
Discret. Appl. Math., March, 2024

Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs.
Discuss. Math. Graph Theory, 2024

Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs.
Discret. Math., 2024

Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs.
Discret. Appl. Math., 2024

2023
Online scheduling with deterioration and unexpected processor breakdown.
Theor. Comput. Sci., September, 2023

Semicomplete compositions of digraphs.
Discret. Math., August, 2023

A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs.
Discret. Math., August, 2023

Directed Steiner tree packing and directed tree connectivity.
J. Graph Theory, 2023

2022
Computation and algorithm for the minimum k-edge-connectivity of graphs.
J. Comb. Optim., 2022

Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty.
J. Comb. Optim., 2022

Minimally strong subgraph (k, ℓ)-arc-connected digraphs.
Discuss. Math. Graph Theory, 2022

Self-converse large sets of pure directed triple systems.
Discret. Math., 2022

Packing strong subgraph in digraphs.
Discret. Optim., 2022

Complexity of directed Steiner path packing problem.
CoRR, 2022

Perfect Out-forests and Steiner Cycle Packing in Digraphs.
CoRR, 2022

Strong subgraph 2-arc-connectivity of Cartesian product of digraphs.
CoRR, 2022

A distributed message passing algorithm for the capacitated directed Chinese postman problem.
Comput. Electr. Eng., 2022

2021
Strong Subgraph Connectivity of Digraphs: A Survey.
J. Interconnect. Networks, 2021

Strong Subgraph Connectivity of Digraphs.
Graphs Comb., 2021

Anti-Ramsey Number of Triangles in Complete Multipartite Graphs.
Graphs Comb., 2021

The minimum size of a graph with given tree connectivity.
Discuss. Math. Graph Theory, 2021

2020
Research on Intelligent Guidance Optimal Path of Shared Car Charging in the IOT Environment.
Wirel. Commun. Mob. Comput., 2020

Research on safe driving behavior of transportation vehicles based on vehicle network data mining.
Trans. Emerg. Telecommun. Technol., 2020

Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs.
Discret. Math., 2020

Approximation Algorithm for Stochastic Set Cover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Strong subgraph k-connectivity.
J. Graph Theory, 2019

Convergence and correctness of belief propagation for the Chinese postman problem.
J. Glob. Optim., 2019

An improved linear kernel for the cycle contraction problem.
Inf. Process. Lett., 2019

Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs.
Discret. Math., 2019

Extremality and Sharp Bounds for the k-edge-connectivity of Graphs.
CoRR, 2019

Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.
Complex., 2019

Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Rainbow matchings in edge-colored complete split graphs.
Eur. J. Comb., 2018

Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number.
Discuss. Math. Graph Theory, 2018

On two generalized connectivities of graphs.
Discuss. Math. Graph Theory, 2018

Large rainbow matchings in semi-strong edge-colorings of graphs.
Discret. Math. Algorithms Appl., 2018

Strong subgraph k-arc-connectivity.
CoRR, 2018

Strong subgraph k-connectivity bounds.
CoRR, 2018

Extremal benzenoid systems for two modified versions of the Randić index.
Appl. Math. Comput., 2018

2017
The (3, l)-Rainbow Edge-Index of Cartesian Product Graphs.
J. Interconnect. Networks, 2017

On the difference of two generalized connectivities of a graph.
J. Comb. Optim., 2017

Extremal coloring for the anti-Ramsey problem of matchings in complete graphs.
J. Comb. Optim., 2017

A sharp lower bound for generalized 3-edge-connectivity of strong product graphs.
Discuss. Math. Graph Theory, 2017

On the maximum and minimum sizes of a graph with given <i>k</i>-connectivity.
Discuss. Math. Graph Theory, 2017

Rainbow connection number of graphs with diameter 3.
Discuss. Math. Graph Theory, 2017

An improved kernel for the cycle contraction problem.
CoRR, 2017

On total rainbow k-connected graphs.
Appl. Math. Comput., 2017

On edge-rupture degree of graphs.
Appl. Math. Comput., 2017

Layout and Perspective Distortion Independent Recognition of Captured Chinese Document Image.
Proceedings of the 14th IAPR International Conference on Document Analysis and Recognition, 2017

2016
Sharp upper bounds for generalized edge-connectivity of product graphs.
Discuss. Math. Graph Theory, 2016

2015
On rainbow total-coloring of a graph.
Discret. Appl. Math., 2015

2014
Note on Minimally d-Rainbow Connected Graphs.
Graphs Comb., 2014

Oriented diameter and rainbow connection number of a graph.
Discret. Math. Theor. Comput. Sci., 2014

Note on the generalized connectivity.
Ars Comb., 2014

Characterize graphs with rainbow connection numbers m-2 and m-3.
Australas. J Comb., 2014

On the generalized (edge-)connectivity of graphs.
Australas. J Comb., 2014

2013
Rainbow Connections of Graphs: A Survey.
Graphs Comb., 2013

2012
Upper Bounds for the Rainbow Connection Numbers of Line Graphs.
Graphs Comb., 2012

The generalized 3-connectivity of Cartesian product.
Discret. Math. Theor. Comput. Sci., 2012

2011
Rainbow Connection of Graphs -- A Survey
CoRR, 2011

Note on the Rainbow k-Connectivity of Regular Complete Bipartite Graphs.
Ars Comb., 2011

Rainbow connection numbers of line graphs.
Ars Comb., 2011

On the rainbow k-connectivity of complete graphs.
Australas. J Comb., 2011

2009
The rainbow k-connectivity of two classes of graphs
CoRR, 2009

2006
Subspace Learning Based on Laplacian Eigenmaps and LDA for Face Recognition.
Int. J. Inf. Acquis., 2006


  Loading...