Zhengke Miao

According to our database1, Zhengke Miao authored at least 62 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On odd colorings of planar graphs.
Discret. Math., January, 2024

Nowhere-Zero 3-Flows in Signed Planar Graphs.
Electron. J. Comb., 2024

2023
The average degree of edge chromatic critical graphs with maximum degree seven.
J. Graph Theory, July, 2023

Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications.
Discret. Appl. Math., April, 2023

List star edge coloring of generalized Halin graphs.
Discret. Math., 2023

2022
Nowhere-zero 3-flows in toroidal graphs.
J. Comb. Theory B, 2022

On the Size of (K<sub>t, </sub> P<sub>k)</sub>-Co-Critical Graphs.
Graphs Comb., 2022

A note on 1-2-3 conjecture for Halin graphs.
Discret. Math. Algorithms Appl., 2022

Note on injective edge-coloring of graphs.
Discret. Appl. Math., 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
Upper bounds on the maximum degree of class two graphs on surfaces.
Discret. Math., 2020

Some remarks on interval colorings of complete tripartite and biregular graphs.
Discret. Appl. Math., 2020

Eulerian Subgraphs and <i>S</i>-connectivity of Graphs.
Appl. Math. Comput., 2020

2019
List star edge coloring of k-degenerate graphs.
Discret. Math., 2019

Collapsible subgraphs of a 4-edge-connected graph.
Discret. Appl. Math., 2019

2018
Neighbor sum distinguishing list total coloring of subcubic graphs.
J. Comb. Optim., 2018

Neighbor sum distinguishing total coloring of graphs with bounded treewidth.
J. Comb. Optim., 2018

Sensitivity of r-hued colouring of graphs.
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

List neighbor sum distinguishing edge coloring of subcubic graphs.
Discret. Math., 2018

2017
Neighbor sum distinguishing index of 2-degenerate graphs.
J. Comb. Optim., 2017

Finding Δ(Σ) for a Surface Σ of Characteristic -6 and -7.
Graphs Comb., 2017

All Quadrilateral-Wheel Planar Ramsey Numbers.
Graphs Comb., 2017

Supereulerian width of dense graphs.
Discret. Math., 2017

Adjacent vertex distinguishing total coloring of graphs with maximum degree 4.
Discret. Math., 2017

Upper bounds on adjacent vertex distinguishing total chromatic number of graphs.
Discret. Appl. Math., 2017

2016
Finding Δ(Σ) for a Surface Σ of Characteristic -4.
J. Graph Theory, 2016

A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable.
J. Comb. Optim., 2016

Hamilton Circuits and Essential Girth of Claw Free Graphs.
Graphs Comb., 2016

Hamiltonian Cycles in Critical Graphs with Large Maximum Degree.
Graphs Comb., 2016

Adjacent vertex distinguishing total colorings of 2-degenerate graphs.
Discret. Math., 2016

Element deletion changes in dynamic coloring of graphs.
Discret. Math., 2016

2015
Strong Circuit Double Cover of Some Cubic Graphs.
J. Graph Theory, 2015

Unique Fulkerson coloring of Petersen minor-free cubic graphs.
Eur. J. Comb., 2015

On the local base of a primitive and nonpowerful sign pattern.
Discret. Math., 2015

Adjacent vertex distinguishing indices of planar graphs without 3-cycles.
Discret. Math., 2015

Neighbor sum distinguishing edge colorings of sparse graphs.
Discret. Appl. Math., 2015

2014
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable.
J. Comb. Optim., 2014

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs.
Int. J. Comput. Math., 2014

On the size of critical graphs with small maximum degree.
Int. J. Comput. Math., 2014

Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts.
Eur. J. Comb., 2014

On the independence number of edge chromatic critical graphs.
Discuss. Math. Graph Theory, 2014

On strong list edge coloring of subcubic graphs.
Discret. Math., 2014

On strongly Z<sub>2s-1</sub>-connected graphs.
Discret. Appl. Math., 2014

The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3.
Ars Comb., 2014

2013
Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable.
J. Graph Theory, 2013

Three conjectures on the signed cycle domination in graphs.
J. Comb. Optim., 2013

Nowhere-Zero 3-Flows of Graphs with Independence Number Two.
Graphs Comb., 2013

Circuit extension and circuit double cover of graphs.
Discret. Math., 2013

Sufficient conditions for a planar graph to be list edge <i>Δ</i>-colorable and list totally (<i>Δ</i>+1)-colorable.
Discret. Math., 2013

<i>L</i>(<i>p</i>, 2, 1)L(p, 2, 1)-labeling of the infinite regular trees.
Discret. Math., 2013

2012
Bases of primitive nonpowerful sign patterns.
Theor. Comput. Sci., 2012

Lumping algorithms for computing Google's PageRank and its derivative, with attention to unreferenced nodes.
Inf. Retr., 2012

A Note on Planar Ramsey Numbers for a Triangle Versus Wheels.
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

Identifying codes and locating-dominating sets on paths and cycles.
Discret. Appl. Math., 2011

The Δ<sup>2</sup>-conjecture for L(2, 1)-labelings is true for total graphs.
Appl. Math. Lett., 2011

2009
The Clique Minor of Graphs with Independence Number Two.
Discret. Math. Algorithms Appl., 2009

Local bases of primitive non-powerful signed digraphs.
Discret. Math., 2009

The Ramsey numbers for cycles versus wheels of odd order.
Appl. Math. Lett., 2009

2003
Improper choosability of graphs embedded on the surface of genus <i>r</i>.
Discret. Math., 2003


  Loading...