Meilian Liang

Orcid: 0000-0002-7839-1174

According to our database1, Meilian Liang authored at least 16 papers between 2009 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
On Ramsey Numbers R(K<sub>4-e, </sub> K<sub>t)</sub>.
Graphs Comb., 2021

2020
Chromatic Vertex Folkman Numbers.
Electron. J. Comb., 2020

2019
The Cyclic Triangle-Free Process.
Symmetry, 2019

A note on upper bounds for some generalized Folkman numbers.
Discuss. Math. Graph Theory, 2019

On a Diagonal Conjecture for classical Ramsey numbers.
Discret. Appl. Math., 2019

2018
On the Nonexistence of Some Generalized Folkman Numbers.
Graphs Comb., 2018

2017
New optimal modular Sidon sets.
Int. J. Auton. Adapt. Commun. Syst., 2017

2014
On rainbow domination numbers of graphs.
Inf. Sci., 2014

On Disjoint Golomb Rulers.
CoRR, 2014

2013
Upper bounds for the vertex Folkman number F<sub>v</sub>(3, 3, 3;4) and F<sub>v</sub>(3, 3, 3;5).
Ars Comb., 2013

An Empirical Study on the Functional Mechanism among Team Trust, Team Commitment and Team Innovation in Chinese High Technology Innovation Teams.
Proceedings of the 12th Wuhan International Conference on E-Business, 2013

2012
Upper bounds on the connection probability for 2-D meshes and tori.
J. Parallel Distributed Comput., 2012

On sets without k-term arithmetic progression.
J. Comput. Syst. Sci., 2012

Some new optimal generalized Sidon sequences.
Ars Comb., 2012

2011
Edge rough graph and its application.
Proceedings of the Eighth International Conference on Fuzzy Systems and Knowledge Discovery, 2011

2009
Routing on Shortest Pair of Disjoint Paths with Bandwidth Guaranteed.
Proceedings of the Eighth IEEE International Conference on Dependable, 2009


  Loading...