default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhengke Miao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j62]Jiaao Li, Yulai Ma, Zhengke Miao, Yongtang Shi, Wei-Fan Wang:
Nowhere-Zero 3-Flows in Signed Planar Graphs. Electron. J. Comb. 31(2) (2024)- [j61]Zhengke Miao, Lin Sun, Zhuojie Tu, Xiaowei Yu
:
On odd colorings of planar graphs. Discret. Math. 347(1): 113706 (2024) - 2023
- [j60]Yan Cao, Rong Luo, Zhengke Miao, Yue Zhao:
Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications. Discret. Appl. Math. 329: 96-105 (2023) - [j59]Zhengke Miao, Yimin Song, Tao Wang, Xiaowei Yu:
List star edge coloring of generalized Halin graphs. Discret. Math. 346(1): 113204 (2023) - [j58]Yan Cao, Rong Luo, Zhengke Miao, Yue Zhao:
The average degree of edge chromatic critical graphs with maximum degree seven. J. Graph Theory 103(3): 517-541 (2023) - 2022
- [j57]Zhengke Miao, Yimin Song, Gexin Yu:
Note on injective edge-coloring of graphs. Discret. Appl. Math. 310: 65-74 (2022) - [j56]Xiaoli Jiang, Zhengke Miao, Xiaowei Yu:
A note on 1-2-3 conjecture for Halin graphs. Discret. Math. Algorithms Appl. 14(7): 2250032:1-2250032:7 (2022) - [j55]Gang Chen, Zhengke Miao, Zi-Xia Song, Jingmei Zhang:
On the Size of (Kt, Pk)-Co-Critical Graphs. Graphs Comb. 38(5): 136 (2022) - [j54]Jiaao Li, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, Cun-Quan Zhang:
Nowhere-zero 3-flows in toroidal graphs. J. Comb. Theory B 153: 61-80 (2022) - 2021
- [j53]Gang Chen, Zhengke Miao, Zi-Xia Song, Jingmei Zhang:
On the size of special class 1 graphs and (P3;k)-co-critical graphs. Discret. Math. 344(12): 112604 (2021) - 2020
- [j52]Miaomiao Han, Zhengke Miao:
Eulerian Subgraphs and S-connectivity of Graphs. Appl. Math. Comput. 382: 125323 (2020) - [j51]Puning Jing, Zhengke Miao, Zi-Xia Song:
Some remarks on interval colorings of complete tripartite and biregular graphs. Discret. Appl. Math. 277: 193-197 (2020) - [j50]Katie Horacek, Rong Luo, Zhengke Miao, Yue Zhao:
Upper bounds on the maximum degree of class two graphs on surfaces. Discret. Math. 343(3): 111738 (2020)
2010 – 2019
- 2019
- [j49]Ran Gu, Hong-Jian Lai, Yanting Liang, Zhengke Miao, Meng Zhang:
Collapsible subgraphs of a 4-edge-connected graph. Discret. Appl. Math. 260: 272-277 (2019) - [j48]Miaomiao Han, Jiaao Li, Rong Luo, Zhengke Miao:
List star edge coloring of k-degenerate graphs. Discret. Math. 342(6): 1838-1848 (2019) - 2018
- [j47]You Lu, Chong Li, Rong Luo, Zhengke Miao:
List neighbor sum distinguishing edge coloring of subcubic graphs. Discret. Math. 341(2): 555-569 (2018) - [j46]Zhengke Miao, Yingqian Wang, Chuanni Zhang, Huajun Zhang:
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable. Discret. Math. 341(3): 588-599 (2018) - [j45]Huimin Song, Lianying Miao, Zhengke Miao, Hong-Jian Lai:
Sensitivity of r-hued colouring of graphs. Int. J. Comput. Math. Comput. Syst. Theory 3(4): 262-273 (2018) - [j44]You Lu, Chuandong Xu, Zhengke Miao:
Neighbor sum distinguishing list total coloring of subcubic graphs. J. Comb. Optim. 35(3): 778-793 (2018) - [j43]Miaomiao Han, You Lu, Rong Luo, Zhengke Miao:
Neighbor sum distinguishing total coloring of graphs with bounded treewidth. J. Comb. Optim. 36(1): 23-34 (2018) - 2017
- [j42]Xiaolan Hu, Yunqing Zhang, Zhengke Miao:
Upper bounds on adjacent vertex distinguishing total chromatic number of graphs. Discret. Appl. Math. 233: 29-32 (2017) - [j41]You Lu, Jiaao Li, Rong Luo, Zhengke Miao:
Adjacent vertex distinguishing total coloring of graphs with maximum degree 4. Discret. Math. 340(2): 119-123 (2017) - [j40]Wei Xiong, Jinquan Xu, Zhengke Miao, Yang Wu, Hong-Jian Lai:
Supereulerian width of dense graphs. Discret. Math. 340(12): 2995-3001 (2017) - [j39]Yaojun Chen, Zhengke Miao, Guofei Zhou:
All Quadrilateral-Wheel Planar Ramsey Numbers. Graphs Comb. 33(2): 335-346 (2017) - [j38]Katie Horacek, Rong Luo, Zhengke Miao, Yue Zhao:
Finding Δ(Σ) for a Surface Σ of Characteristic -6 and -7. Graphs Comb. 33(4): 929-944 (2017) - [j37]Xiaolan Hu, Yaojun Chen, Rong Luo, Zhengke Miao:
Neighbor sum distinguishing index of 2-degenerate graphs. J. Comb. Optim. 34(3): 798-809 (2017) - 2016
- [j36]Lianying Miao, Hong-Jian Lai, Yan-Fang Guo, Zhengke Miao:
Element deletion changes in dynamic coloring of graphs. Discret. Math. 339(5): 1600-1604 (2016) - [j35]Zhengke Miao, Rui Shi, Xiaolan Hu, Rong Luo:
Adjacent vertex distinguishing total colorings of 2-degenerate graphs. Discret. Math. 339(10): 2446-2449 (2016) - [j34]Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang:
Hamilton Circuits and Essential Girth of Claw Free Graphs. Graphs Comb. 32(1): 311-321 (2016) - [j33]Rong Luo, Zhengke Miao, Yue Zhao:
Hamiltonian Cycles in Critical Graphs with Large Maximum Degree. Graphs Comb. 32(5): 2019-2028 (2016) - [j32]Zhengke Miao, Qiaojun Shu, Weifan Wang, Dong Chen:
A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. J. Comb. Optim. 31(2): 893-901 (2016) - [j31]Rong Luo, Zhengke Miao, Yue Zhao:
Finding Δ(Σ) for a Surface Σ of Characteristic -4. J. Graph Theory 83(3): 277-302 (2016) - 2015
- [j30]Xiaolan Hu, Yaojun Chen, Rong Luo, Zhengke Miao:
Neighbor sum distinguishing edge colorings of sparse graphs. Discret. Appl. Math. 193: 119-125 (2015) - [j29]Danjun Huang, Zhengke Miao, Weifan Wang:
Adjacent vertex distinguishing indices of planar graphs without 3-cycles. Discret. Math. 338(3): 139-148 (2015) - [j28]Guanglong Yu, Zhengke Miao:
On the local base of a primitive and nonpowerful sign pattern. Discret. Math. 338(8): 1473-1480 (2015) - [j27]Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang:
Unique Fulkerson coloring of Petersen minor-free cubic graphs. Eur. J. Comb. 43: 165-171 (2015) - [j26]Zhengke Miao, Wenliang Tang, Cun-Quan Zhang:
Strong Circuit Double Cover of Some Cubic Graphs. J. Graph Theory 78(2): 131-142 (2015) - 2014
- [j25]Guanglong Yu, Zhengke Miao, Chao Yan, Jinlong Shu:
The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3. Ars Comb. 115: 401-410 (2014) - [j24]Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang:
On strongly Z2s-1-connected graphs. Discret. Appl. Math. 174: 73-80 (2014) - [j23]Hong Zhu, Zhengke Miao:
On strong list edge coloring of subcubic graphs. Discret. Math. 333: 6-13 (2014) - [j22]Lianying Miao, Zhengke Miao, Shiyou Pang, Wenyao Song:
On the independence number of edge chromatic critical graphs. Discuss. Math. Graph Theory 34(3): 577-584 (2014) - [j21]Rong Luo, Zhengke Miao, Rui Xu, Cun-Quan Zhang:
Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts. Eur. J. Comb. 36: 7-16 (2014) - [j20]Jinquan Xu, Ping Li, Zhengke Miao, Keke Wang, Hong-Jian Lai:
Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs. Int. J. Comput. Math. 91(8): 1662-1672 (2014) - [j19]Lianying Miao, Wenyao Song, Shiyou Pang, Zhengke Miao:
On the size of critical graphs with small maximum degree. Int. J. Comput. Math. 91(10): 2142-2151 (2014) - [j18]Lingji Xu, Zhengke Miao, Yingqian Wang:
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable. J. Comb. Optim. 28(4): 774-786 (2014) - 2013
- [j17]Qiuli Lu, Zhengke Miao, Yingqian Wang:
Sufficient conditions for a planar graph to be list edge Δ-colorable and list totally (Δ+1)-colorable. Discret. Math. 313(5): 575-580 (2013) - [j16]Zhengke Miao, Dong Ye, Cun-Quan Zhang:
Circuit extension and circuit double cover of graphs. Discret. Math. 313(20): 2055-2060 (2013) - [j15]Ziming Duan, Lianying Miao, Cuiqi Wang, Zhengke Miao:
L(p, 2, 1)L(p, 2, 1)-labeling of the infinite regular trees. Discret. Math. 313(20): 2330-2336 (2013) - [j14]Rong Luo, Zhengke Miao, Rui Xu:
Nowhere-Zero 3-Flows of Graphs with Independence Number Two. Graphs Comb. 29(6): 1899-1907 (2013) - [j13]Jian Guan, Xiaoyan Liu, Changhong Lu, Zhengke Miao:
Three conjectures on the signed cycle domination in graphs. J. Comb. Optim. 25(4): 639-645 (2013) - [j12]Yingqian Wang, Xianghua Mao, Zhengke Miao:
Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable. J. Graph Theory 73(3): 305-317 (2013) - 2012
- [j11]Guofei Zhou, Yaojun Chen, Zhengke Miao, Shariefuddin Pirzada:
A Note on Planar Ramsey Numbers for a Triangle Versus Wheels. Discret. Math. Theor. Comput. Sci. 14(2): 255-260 (2012) - [j10]Qing Yu, Zhengke Miao, Gang Wu, Yimin Wei:
Lumping algorithms for computing Google's PageRank and its derivative, with attention to unreferenced nodes. Inf. Retr. 15(6): 503-526 (2012) - [j9]Guanglong Yu, Zhengke Miao, Jinlong Shu:
Bases of primitive nonpowerful sign patterns. Theor. Comput. Sci. 447: 136-143 (2012) - 2011
- [j8]Ziming Duan, Pingli Lv, Lianying Miao, Zhengke Miao, Cuiqi Wang:
The Δ2-conjecture for L(2, 1)-labelings is true for total graphs. Appl. Math. Lett. 24(9): 1491-1494 (2011) - [j7]Chunxia Chen, Changhong Lu, Zhengke Miao:
Identifying codes and locating-dominating sets on paths and cycles. Discret. Appl. Math. 159(15): 1540-1547 (2011) - [j6]Guanglong Yu, Zhengke Miao, Jinlong Shu:
The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries. Discret. Math. 311(6): 493-503 (2011) - [j5]Ziming Duan, Pingli Lv, Lianying Miao, Zhengke Miao, Cuiqi Wang:
New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs. Theor. Comput. Sci. 412(22): 2393-2397 (2011) - 2010
- [c1]Guanglong Yu, Zhengke Miao, Jinlong Shu:
Bases of Primitive Nonpowerful Sign Patterns. COCOA (1) 2010: 114-127
2000 – 2009
- 2009
- [j4]Yaojun Chen, T. C. Edwin Cheng, Zhengke Miao, C. T. Ng:
The Ramsey numbers for cycles versus wheels of odd order. Appl. Math. Lett. 22(12): 1875-1876 (2009) - [j3]Longqin Wang, Zhengke Miao, Chao Yan:
Local bases of primitive non-powerful signed digraphs. Discret. Math. 309(4): 748-754 (2009) - [j2]Shiyou Pang, Lianying Miao, Qingbo Sun, Zhengke Miao:
The Clique Minor of Graphs with Independence Number Two. Discret. Math. Algorithms Appl. 1(1): 121-126 (2009) - 2003
- [j1]Zhengke Miao:
Improper choosability of graphs embedded on the surface of genus r. Discret. Math. 269(1-3): 311-314 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
