Improper choosability of graphs embedded on the surface of genus r. - Zhengke Miao (Discret. Math., 2003)

The Ramsey numbers for cycles versus wheels of odd order. - Yaojun Chen; T. C. Edwin Cheng; Zhengke Miao; C. T. Ng 001 (Appl. Math. Lett., 2009)

Local bases of primitive non-powerful signed digraphs. - Longqin Wang; Zhengke Miao; Chao Yan (Discret. Math., 2009)

The Clique Minor of Graphs with Independence Number Two. - Shiyou Pang; Lianying Miao; Qingbo Sun; Zhengke Miao (Discret. Math. Algorithms Appl., 2009)

The Δ2-conjecture for L(2, 1)-labelings is true for total graphs. - Ziming Duan; Pingli Lv; Lianying Miao; Zhengke Miao; Cuiqi Wang (Appl. Math. Lett., 2011)

Identifying codes and locating-dominating sets on paths and cycles. - Chunxia Chen; Changhong Lu; Zhengke Miao (Discret. Appl. Math., 2011)

The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries. - Guanglong Yu; Zhengke Miao; Jinlong Shu (Discret. Math., 2011)

New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs. - Ziming Duan; Pingli Lv; Lianying Miao; Zhengke Miao; Cuiqi Wang (Theor. Comput. Sci., 2011)

A Note on Planar Ramsey Numbers for a Triangle Versus Wheels. - Guofei Zhou; Yaojun Chen; Zhengke Miao; Shariefuddin Pirzada (Discret. Math. Theor. Comput. Sci., 2012)

Lumping algorithms for computing Google's PageRank and its derivative, with attention to unreferenced nodes. - Qing Yu; Zhengke Miao; Gang Wu 014; Yimin Wei 001 (Inf. Retr., 2012)

Bases of primitive nonpowerful sign patterns. - Guanglong Yu; Zhengke Miao; Jinlong Shu (Theor. Comput. Sci., 2012)

L(p, 2, 1)L(p, 2, 1)-labeling of the infinite regular trees. - Ziming Duan; Lianying Miao; Cuiqi Wang; Zhengke Miao (Discret. Math., 2013)

Sufficient conditions for a planar graph to be list edge Δ-colorable and list totally (Δ+1)-colorable. - Qiuli Lu; Zhengke Miao; Yingqian Wang 001 (Discret. Math., 2013)

Circuit extension and circuit double cover of graphs. - Zhengke Miao; Dong Ye 002; Cun-Quan Zhang (Discret. Math., 2013)

Nowhere-Zero 3-Flows of Graphs with Independence Number Two. - Rong Luo; Zhengke Miao; Rui Xu 023 (Graphs Comb., 2013)

Three conjectures on the signed cycle domination in graphs. - Jian Guan; Xiaoyan Liu; Changhong Lu; Zhengke Miao (J. Comb. Optim., 2013)

Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable. - Yingqian Wang 001; Xianghua Mao; Zhengke Miao (J. Graph Theory, 2013)

The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3. - Guanglong Yu; Zhengke Miao; Chao Yan; Jinlong Shu (Ars Comb., 2014)

On strongly Z2s-1-connected graphs. - Hong-Jian Lai; Yanting Liang; Juan Liu 001; Jixiang Meng; Zhengke Miao; Yehong Shao; Zhao Zhang 002 (Discret. Appl. Math., 2014)

On strong list edge coloring of subcubic graphs. - Hong Zhu; Zhengke Miao (Discret. Math., 2014)

On the independence number of edge chromatic critical graphs. - Lianying Miao; Zhengke Miao; Shiyou Pang; Wenyao Song (Discuss. Math. Graph Theory, 2014)

Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts. - Rong Luo; Zhengke Miao; Rui Xu 023; Cun-Quan Zhang (Eur. J. Comb., 2014)

On the size of critical graphs with small maximum degree. - Lianying Miao; Wenyao Song; Shiyou Pang; Zhengke Miao (Int. J. Comput. Math., 2014)

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs. - Jinquan Xu; Ping Li 023; Zhengke Miao; Keke Wang; Hong-Jian Lai (Int. J. Comput. Math., 2014)

Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable. - Lingji Xu; Zhengke Miao; Yingqian Wang 001 (J. Comb. Optim., 2014)

Neighbor sum distinguishing edge colorings of sparse graphs. - Xiaolan Hu; Yaojun Chen; Rong Luo; Zhengke Miao (Discret. Appl. Math., 2015)

Adjacent vertex distinguishing indices of planar graphs without 3-cycles. - Danjun Huang; Zhengke Miao; Weifan Wang 001 (Discret. Math., 2015)

On the local base of a primitive and nonpowerful sign pattern. - Guanglong Yu; Zhengke Miao (Discret. Math., 2015)

Unique Fulkerson coloring of Petersen minor-free cubic graphs. - Zhengke Miao; Xiaofeng Wang; Cun-Quan Zhang (Eur. J. Comb., 2015)

Strong Circuit Double Cover of Some Cubic Graphs. - Zhengke Miao; Wenliang Tang; Cun-Quan Zhang (J. Graph Theory, 2015)

Element deletion changes in dynamic coloring of graphs. - Lianying Miao; Hong-Jian Lai; Yan-Fang Guo; Zhengke Miao (Discret. Math., 2016)

Adjacent vertex distinguishing total colorings of 2-degenerate graphs. - Zhengke Miao; Rui Shi; Xiaolan Hu; Rong Luo (Discret. Math., 2016)

Hamiltonian Cycles in Critical Graphs with Large Maximum Degree. - Rong Luo; Zhengke Miao; Yue Zhao 008 (Graphs Comb., 2016)

Hamilton Circuits and Essential Girth of Claw Free Graphs. - Zhengke Miao; Xiaofeng Wang; Cun-Quan Zhang (Graphs Comb., 2016)

A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. - Zhengke Miao; Qiaojun Shu; Weifan Wang 001; Dong Chen 012 (J. Comb. Optim., 2016)

Finding Δ(Σ) for a Surface Σ of Characteristic -4. - Rong Luo; Zhengke Miao; Yue Zhao 008 (J. Graph Theory, 2016)

Upper bounds on adjacent vertex distinguishing total chromatic number of graphs. - Xiaolan Hu; Yunqing Zhang; Zhengke Miao (Discret. Appl. Math., 2017)

Adjacent vertex distinguishing total coloring of graphs with maximum degree 4. - You Lu 002; Jiaao Li; Rong Luo; Zhengke Miao (Discret. Math., 2017)

Supereulerian width of dense graphs. - Wei Xiong 002; Jinquan Xu; Zhengke Miao; Yang Wu 007; Hong-Jian Lai (Discret. Math., 2017)

All Quadrilateral-Wheel Planar Ramsey Numbers. - Yaojun Chen; Zhengke Miao; Guofei Zhou (Graphs Comb., 2017)

Finding Δ(Σ) for a Surface Σ of Characteristic -6 and -7. - Katie Horacek; Rong Luo; Zhengke Miao; Yue Zhao 008 (Graphs Comb., 2017)

Neighbor sum distinguishing index of 2-degenerate graphs. - Xiaolan Hu; Yaojun Chen; Rong Luo; Zhengke Miao (J. Comb. Optim., 2017)

List neighbor sum distinguishing edge coloring of subcubic graphs. - You Lu 002; Chong Li; Rong Luo; Zhengke Miao (Discret. Math., 2018)

Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable. - Zhengke Miao; Yingqian Wang 001; Chuanni Zhang; Huajun Zhang (Discret. Math., 2018)

Sensitivity of r-hued colouring of graphs. - Huimin Song; Lianying Miao; Zhengke Miao; Hong-Jian Lai (Int. J. Comput. Math. Comput. Syst. Theory, 2018)

Neighbor sum distinguishing total coloring of graphs with bounded treewidth. - Miaomiao Han; You Lu 002; Rong Luo; Zhengke Miao (J. Comb. Optim., 2018)

Neighbor sum distinguishing list total coloring of subcubic graphs. - You Lu 002; Chuandong Xu; Zhengke Miao (J. Comb. Optim., 2018)

Collapsible subgraphs of a 4-edge-connected graph. - Ran Gu; Hong-Jian Lai; Yanting Liang; Zhengke Miao; Meng Zhang 005 (Discret. Appl. Math., 2019)

List star edge coloring of k-degenerate graphs. - Miaomiao Han; Jiaao Li; Rong Luo; Zhengke Miao (Discret. Math., 2019)

Eulerian Subgraphs and S-connectivity of Graphs. - Miaomiao Han; Zhengke Miao (Appl. Math. Comput., 2020)

Some remarks on interval colorings of complete tripartite and biregular graphs. - Puning Jing; Zhengke Miao; Zi-Xia Song (Discret. Appl. Math., 2020)

Upper bounds on the maximum degree of class two graphs on surfaces. - Katie Horacek; Rong Luo; Zhengke Miao; Yue Zhao 008 (Discret. Math., 2020)

On the size of special class 1 graphs and (P3;k)-co-critical graphs. - Gang Chen; Zhengke Miao; Zi-Xia Song; Jingmei Zhang (Discret. Math., 2021)

Note on injective edge-coloring of graphs. - Zhengke Miao; Yimin Song; Gexin Yu (Discret. Appl. Math., 2022)

A note on 1-2-3 conjecture for Halin graphs. - Xiaoli Jiang; Zhengke Miao; Xiaowei Yu (Discret. Math. Algorithms Appl., 2022)

On the Size of (Kt, Pk)-Co-Critical Graphs. - Gang Chen; Zhengke Miao; Zi-Xia Song; Jingmei Zhang (Graphs Comb., 2022)

Nowhere-zero 3-flows in toroidal graphs. - Jiaao Li; Yulai Ma; Zhengke Miao; Yongtang Shi; Weifan Wang 001; Cun-Quan Zhang (J. Comb. Theory B, 2022)

List star edge coloring of generalized Halin graphs. - Zhengke Miao; Yimin Song; Tao Wang 005; Xiaowei Yu (Discret. Math., 2023)

Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications. - Yan Cao 001; Rong Luo; Zhengke Miao; Yue Zhao 008 (Discret. Appl. Math., 2023)

The average degree of edge chromatic critical graphs with maximum degree seven. - Yan Cao 001; Rong Luo; Zhengke Miao; Yue Zhao 008 (J. Graph Theory, 2023)

Nowhere-Zero 3-Flows in Signed Planar Graphs. - Jiaao Li; Yulai Ma; Zhengke Miao; Yongtang Shi; Wei-Fan Wang 001 (Electron. J. Comb., 2024)

On odd colorings of planar graphs. - Zhengke Miao; Lin Sun; Zhuojie Tu; Xiaowei Yu (Discret. Math., 2024)

Signed Circuit $6$-Covers of Signed $K_4$-Minor-Free Graphs. - You Lu 002; Rong Luo; Zhengke Miao; Cun-Quan Zhang (Electron. J. Comb., 2025)