default search action
Yuehua Bu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j47]Junlei Zhu
, Hongguo Zhu
Injective edge chromatic number of sparse graphs. Appl. Math. Comput. 473: 128668 (2024) - [j46]Yuehua Bu, Peng Wang, Hongguo Zhu, Junlei Zhu:
Injective chromatic index of sparse graphs. Discret. Appl. Math. 345: 9-16 (2024) - [j45]Yuehua Bu, Peng Wang, Hongguo Zhu:
Injective-edge-coloring of planar graphs with girth restriction. Discret. Math. Algorithms Appl. 16(5): 2350050:1-2350050:11 (2024) - 2023
- [j44]Yuehua Bu, Zewei Zhang
2-Distance coloring of planar graphs without triangles and intersecting 4-cycles. Discret. Math. Algorithms Appl. 15(2): 2250084:1-2250084:20 (2023) - [j43]Junlei Zhu
Injective edge coloring of sparse graphs with maximum degree 5. J. Comb. Optim. 45(1): 46 (2023) - [j42]Ruiying Yang, Yuehua Bu, Junlei Zhu, Hongguo Zhu
The r-dynamic chromatic number of planar graphs without 4-, 5-cycles. J. Comb. Optim. 45(1): 47 (2023) - [j41]Yuehua Bu, Zewei Zhang, Hongguo Zhu
2-Distance coloring of planar graphs without adjacent 5-cycles. J. Comb. Optim. 45(5): 126 (2023) - 2022
- [j40]Junlei Zhu
Wegner's Conjecture on 2-distance coloring for planar graphs. Theor. Comput. Sci. 926: 71-74 (2022) - [c6]Yuehua Bu, Ruiying Yang, Hongguo Zhu:
The r-Dynamic Chromatic Number of Planar Graphs Without Special Short Cycles. AAIM 2022: 316-326 - [c5]Yuehua Bu, Wenwen Chen, Junlei Zhu
Injective Edge Coloring of Power Graphs and Necklaces. AAIM 2022: 413-420 - 2021
- [j39]Yuehua Bu, Chentao Qi, Junlei Zhu, Ting Xu:
Injective coloring of planar graphs. Theor. Comput. Sci. 857: 114-122 (2021) - [c4]Junlei Zhu, Yuehua Bu, Hongguo Zhu:
Wegner's Conjecture on 2-Distance Coloring. AAIM 2021: 400-405 - 2020
- [j38]Yuehua Bu, Xiaofang Wang:
r-Hued coloring of planar graphs without short cycles. Discret. Math. Algorithms Appl. 12(3): 2050034:1-2050034:17 (2020) - [j37]Junlei Zhu, Yuehua Bu:
List r-dynamic coloring of sparse graphs. Theor. Comput. Sci. 817: 1-11 (2020) - [c3]Yuehua Bu
Injective Coloring of Halin Graphs. AAIM 2020: 492-500
2010 – 2019
- 2019
- [j36]Junlei Zhu
List r-dynamic coloring of graphs with small maximum average degree. Discret. Appl. Math. 258: 254-263 (2019) - 2018
- [j35]Yuehua Bu, Chao Wang, Sheng Yang:
List injective Coloring of Planar Graphs. Ars Comb. 141: 191-211 (2018) - [j34]Yuehua Bu, Chentao Qi:
Injective edge coloring of sparse graphs. Discret. Math. Algorithms Appl. 10(2): 1850022:1-1850022:16 (2018) - [j33]Yuehua Bu, Chao-Yuan Huang:
List injective coloring of a class of planar graphs without short cycles. Discret. Math. Algorithms Appl. 10(5): 1850068:1-1850068:12 (2018) - [j32]Junlei Zhu, Yuehua Bu, Yun Dai:
Upper bounds for adjacent vertex-distinguishing edge coloring. J. Comb. Optim. 35(2): 454-462 (2018) - [j31]Junlei Zhu, Yuehua Bu:
Minimum 2-distance coloring of planar graphs and channel assignment. J. Comb. Optim. 36(1): 55-64 (2018) - [j30]Ling Gai, Hongwei Du, Lidong Wu, Junlei Zhu, Yuehua Bu:
Blocking Rumor by Cut. J. Comb. Optim. 36(2): 392-399 (2018) - [j29]Junlei Zhu, Yuehua Bu, Panayote M. Pardalos, Hongwei Du, Huijuan Wang, Bin Liu:
Optimal channel assignment and L(p, 1)-labeling. J. Glob. Optim. 72(3): 539-552 (2018) - [c2]Junlei Zhu
Channel Assignment with r-Dynamic Coloring. AAIM 2018: 36-48 - 2017
- [j28]Yuehua Bu, Hongguo Zhu:
Strong edge-coloring of subcubic planar graphs. Discret. Math. Algorithms Appl. 9(1): 1750013:1-1750013:11 (2017) - 2016
- [j27]Yuehua Bu, Chunhui Shang:
List 2-distance coloring of planar graphs without short cycles. Discret. Math. Algorithms Appl. 8(1): 1650013:1-1650013:17 (2016) - [j26]Yuehua Bu, Xia Lv:
2-Distance coloring of a planar graph without 3, 4, 7-cycles. J. Comb. Optim. 32(1): 244-259 (2016) - 2015
- [j25]Yuehua Bu, Xia Lv, Xiaoyan Yan:
The list 2-distance coloring of a graph with Δ(G) = 5. Discret. Math. Algorithms Appl. 7(2): 1550017:1-1550017:11 (2015) - [j24]Junlei Zhu, Yuehua Bu, Xiao Min:
Equitable List-Coloring for C 5-Free Plane Graphs Without Adjacent Triangles. Graphs Comb. 31(3): 795-804 (2015) - [j23]Yuehua Bu, Kai Lu, Sheng Yang:
Two smaller upper bounds of list injective chromatic number. J. Comb. Optim. 29(2): 373-388 (2015) - [j22]Yuehua Bu, Jinghan Xu, Yingqian Wang
(1, 0, 0)-Colorability of planar graphs without prescribed short cycles. J. Comb. Optim. 30(3): 627-646 (2015) - [j21]Yuehua Bu, Xiaoyan Yan:
List 2-distance coloring of planar graphs. J. Comb. Optim. 30(4): 1180-1195 (2015) - [j20]Yuehua Bu, Xu Dong Bao:
Backbone coloring of planar graphs for C8-free or C9-free. Theor. Comput. Sci. 580: 50-58 (2015) - 2014
- [j19]Yuehua Bu, Stephen Finbow, Daphne Der-Fen Liu, Xuding Zhu:
List backbone colouring of graphs. Discret. Appl. Math. 167: 45-51 (2014) - [j18]Yuehua Bu, Sheng Yang:
List Injective Coloring of Planar graphs with girth G ≥ 5. Discret. Math. Algorithms Appl. 6(1) (2014) - 2013
- [j17]Yuehua Bu, Kai Lu:
List injective coloring of planar graphs with girth 5, 6, 8. Discret. Appl. Math. 161(10-11): 1367-1377 (2013) - [j16]Yuehua Bu, Daphne Der-Fen Liu, Xuding Zhu:
Backbone coloring for graphs with large girths. Discret. Math. 313(18): 1799-1804 (2013) - [j15]Yuehua Bu, Caixia Fu:
(1, 1, 0)-coloring of planar graphs without cycles of length 4 and 6. Discret. Math. 313(23): 2737-2741 (2013) - 2012
- [j14]Yuehua Bu, Kai Lu:
Injective Coloring of Planar Graphs with girth 7. Discret. Math. Algorithms Appl. 4(2) (2012) - [j13]Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud:
On backbone coloring of graphs. J. Comb. Optim. 23(1): 79-93 (2012) - [j12]Yuehua Bu, Xubo Zhu:
An optimal square coloring of planar graphs. J. Comb. Optim. 24(4): 580-592 (2012) - 2011
- [j11]Yuehua Bu, Yudie Wu:
k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS. Discret. Math. Algorithms Appl. 3(2): 171-184 (2011) - [j10]Yuehua Bu, Ko-Wei Lih, Weifan Wang:
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Discuss. Math. Graph Theory 31(3): 429-439 (2011) - [j9]Yuehua Bu, Yulin Li:
Backbone coloring of planar graphs without special circles. Theor. Comput. Sci. 412(46): 6464-6468 (2011) - 2010
- [j8]Yuehua Bu, Qiong Li, Shuiming Zhang:
Equitable Coloring of 2-degenerate Graph and Plane Graphs without cycles of Specific lengths. Discret. Math. Algorithms Appl. 2(2): 207-212 (2010) - [j7]Junlei Zhu, Yuehua Bu:
Equitable and equitable list colorings of graphs. Theor. Comput. Sci. 411(43): 3873-3876 (2010)
2000 – 2009
- 2009
- [j6]Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang:
Injective coloring of planar graphs. Discret. Appl. Math. 157(4): 663-672 (2009) - [j5]Qiong Li, Yuehua Bu:
Equitable list coloring of planar graphs without 4- and 6-cycles. Discret. Math. 309(1): 280-287 (2009) - [j4]Huajing Lu, Yingqian Wang
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discret. Math. 309(13): 4596-4607 (2009) - [j3]Yuehua Bu, Daniel W. Cranston
Star coloring of sparse graphs. J. Graph Theory 62(3): 201-219 (2009) - 2008
- [j2]Junlei Zhu, Yuehua Bu:
Equitable list colorings of planar graphs without short cycles. Theor. Comput. Sci. 407(1-3): 21-28 (2008) - [c1]Guanfeng Ren, Yuehua Bu:
Multicoloring the Mycielskian of Graphs. GrC 2008: 548-551 - 2006
- [j1]Yuehua Bu, Weifan Wang:
Some sufficient conditions for a planar graph of maximum degree six to be Class 1. Discret. Math. 306(13): 1440-1445 (2006)
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 2024-09-13 00:40 CEST 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: