Zhengke Miao
According to our database1,
Zhengke Miao
authored at least 62 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2023
J. Graph Theory, July, 2023
Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications.
Discret. Appl. Math., April, 2023
2022
Graphs Comb., 2022
2021
On the size of special class 1 graphs and (<i>P</i><sub>3</sub>;<i>k</i>)-co-critical graphs.
Discret. Math., 2021
2020
Discret. Math., 2020
Discret. Appl. Math., 2020
2019
2018
J. Comb. Optim., 2018
J. Comb. Optim., 2018
Int. J. Comput. Math. Comput. Syst. Theory, 2018
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable.
Discret. Math., 2018
Discret. Math., 2018
2017
Discret. Math., 2017
Discret. Appl. Math., 2017
2016
J. Comb. Optim., 2016
Discret. Math., 2016
2015
Discret. Math., 2015
Discret. Appl. Math., 2015
2014
J. Comb. Optim., 2014
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs.
Int. J. Comput. Math., 2014
Int. J. Comput. Math., 2014
Eur. J. Comb., 2014
Discuss. Math. Graph Theory, 2014
The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3.
Ars Comb., 2014
2013
J. Graph Theory, 2013
Sufficient conditions for a planar graph to be list edge <i>Δ</i>-colorable and list totally (<i>Δ</i>+1)-colorable.
Discret. Math., 2013
Discret. Math., 2013
2012
Lumping algorithms for computing Google's PageRank and its derivative, with attention to unreferenced nodes.
Inf. Retr., 2012
Discret. Math. Theor. Comput. Sci., 2012
2011
New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs.
Theor. Comput. Sci., 2011
The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries.
Discret. Math., 2011
Discret. Appl. Math., 2011
Appl. Math. Lett., 2011
2009
Discret. Math. Algorithms Appl., 2009
2003
Discret. Math., 2003