Yuefang Sun

Appl. Math. Comput., April, 2024

Anti-Ramsey number of matchings in outerplanar graphs.

[BibT_eX]

[DOI]

Rui Yu

Discret. Appl. Math., March, 2024

2023

Online scheduling with deterioration and unexpected processor breakdown.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

Semicomplete compositions of digraphs.

[BibT_eX]

[DOI]

Discret. Math., August, 2023

A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs.

[BibT_eX]

[DOI]

Ansong Ma

Xiaoyan Zhang

Discret. Math., August, 2023

Directed Steiner tree packing and directed tree connectivity.

[BibT_eX]

[DOI]

Anders Yeo

J. Graph Theory, 2023

2022

Computation and algorithm for the minimum k-edge-connectivity of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Minimally strong subgraph (k, ℓ)-arc-connected digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

Self-converse large sets of pure directed triple systems.

[BibT_eX]

[DOI]

Discret. Math., 2022

Packing strong subgraph in digraphs.

[BibT_eX]

[DOI]

Xiaoyan Zhang

Discret. Optim., 2022

Complexity of directed Steiner path packing problem.

[BibT_eX]

[DOI]

CoRR, 2022

Perfect Out-forests and Steiner Cycle Packing in Digraphs.

[BibT_eX]

[DOI]

CoRR, 2022

Strong subgraph 2-arc-connectivity of Cartesian product of digraphs.

[BibT_eX]

[DOI]

Yiling Dong

CoRR, 2022

A distributed message passing algorithm for the capacitated directed Chinese postman problem.

[BibT_eX]

[DOI]

Comput. Electr. Eng., 2022

2021

Strong Subgraph Connectivity of Digraphs: A Survey.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2021

Strong Subgraph Connectivity of Digraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Anti-Ramsey Number of Triangles in Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Kangyun Zhong

Graphs Comb., 2021

The minimum size of a graph with given tree connectivity.

[BibT_eX]

[DOI]

Bin Sheng

Discuss. Math. Graph Theory, 2021

2020

Research on Intelligent Guidance Optimal Path of Shared Car Charging in the IOT Environment.

[BibT_eX]

[DOI]

Wirel. Commun. Mob. Comput., 2020

Research on safe driving behavior of transportation vehicles based on vehicle network data mining.

[BibT_eX]

[DOI]

Trans. Emerg. Telecommun. Technol., 2020

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

[BibT_eX]

[DOI]

Discret. Math., 2020

Approximation Algorithm for Stochastic Set Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

Strong subgraph k-connectivity.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Convergence and correctness of belief propagation for the Chinese postman problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

An improved linear kernel for the cycle contraction problem.

[BibT_eX]

[DOI]

Bin Sheng

Inf. Process. Lett., 2019

Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs.

[BibT_eX]

[DOI]

Jiangdong Ai

Discret. Math., 2019

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

[BibT_eX]

[DOI]

Xiaoyan Zhang

Zhao Zhang

CoRR, 2019

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

[BibT_eX]

[DOI]

Complex., 2019

Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Rainbow matchings in edge-colored complete split graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number.

[BibT_eX]

[DOI]

Jianhua Tu

Discuss. Math. Graph Theory, 2018

On two generalized connectivities of graphs.

[BibT_eX]

[DOI]

Fengwei Li

Discuss. Math. Graph Theory, 2018

Large rainbow matchings in semi-strong edge-colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2018

Strong subgraph k-arc-connectivity.

[BibT_eX]

[DOI]

CoRR, 2018

Strong subgraph k-connectivity bounds.

[BibT_eX]

[DOI]

CoRR, 2018

Extremal benzenoid systems for two modified versions of the Randić index.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

The (3, l)-Rainbow Edge-Index of Cartesian Product Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2017

On the difference of two generalized connectivities of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Extremal coloring for the anti-Ramsey problem of matchings in complete graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

A sharp lower bound for generalized 3-edge-connectivity of strong product graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

On the maximum and minimum sizes of a graph with given <i>k</i>-connectivity.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Rainbow connection number of graphs with diameter 3.

[BibT_eX]

[DOI]

Hengzhe Li

Discuss. Math. Graph Theory, 2017

An improved kernel for the cycle contraction problem.

[BibT_eX]

[DOI]

Bin Sheng

CoRR, 2017

On total rainbow k-connected graphs.

[BibT_eX]

[DOI]

Fengwei Li

Appl. Math. Comput., 2017

On edge-rupture degree of graphs.

[BibT_eX]

[DOI]

Fengwei Li

Qingfang Ye

Appl. Math. Comput., 2017

Layout and Perspective Distortion Independent Recognition of Captured Chinese Document Image.

[BibT_eX]

[DOI]

Yanwei Wang

Changsong Liu

Proceedings of the 14th IAPR International Conference on Document Analysis and Recognition, 2017

2016

Sharp upper bounds for generalized edge-connectivity of product graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

2015

On rainbow total-coloring of a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

Note on Minimally d-Rainbow Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Oriented diameter and rainbow connection number of a graph.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Note on the generalized connectivity.

[BibT_eX]

Ars Comb., 2014

Characterize graphs with rainbow connection numbers m-2 and m-3.

[BibT_eX]

[DOI]

Yan Zhao

Australas. J Comb., 2014

On the generalized (edge-)connectivity of graphs.

[BibT_eX]

[DOI]

Yaping Mao

Australas. J Comb., 2014

2013

Rainbow Connections of Graphs: A Survey.

[BibT_eX]

[DOI]

Yongtang Shi

Graphs Comb., 2013

2012

Upper Bounds for the Rainbow Connection Numbers of Line Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

The generalized 3-connectivity of Cartesian product.

[BibT_eX]

[DOI]

Hengzhe Li

Discret. Math. Theor. Comput. Sci., 2012

2011

Rainbow Connection of Graphs -- A Survey

[BibT_eX]

[DOI]

CoRR, 2011

Note on the Rainbow k-Connectivity of Regular Complete Bipartite Graphs.

[BibT_eX]

Ars Comb., 2011

Rainbow connection numbers of line graphs.

[BibT_eX]

Ars Comb., 2011

On the rainbow k-connectivity of complete graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2011

2009

The rainbow k-connectivity of two classes of graphs

[BibT_eX]

[DOI]

CoRR, 2009

2006

Subspace Learning Based on Laplacian Eigenmaps and LDA for Face Recognition.

[BibT_eX]

[DOI]

Yanwei Pang

Zhengkai Liu