Yuehua Bu

From MaRDI portal
Person:328714

Available identifiers

zbMath Open bu.yuehuaMaRDI QIDQ328714

List of research outcomes





PublicationDate of PublicationType
The 2-distance chromatic number of planar graphs without 3,4,8-cycles2024-11-28Paper
Injective-edge-coloring of planar graphs with girth restriction2024-11-13Paper
Injective edge chromatic number of sparse graphs2024-08-12Paper
Channel assignment with \(r\)-dynamic coloring2023-10-16Paper
2-distance coloring of planar graphs without adjacent 5-cycles2023-08-02Paper
2-Distance coloring of planar graphs without triangles and intersecting 4-cycles2023-07-14Paper
The \(r\)-dynamic chromatic number of planar graphs without special short cycles2023-07-07Paper
Injective edge coloring of power graphs and necklaces2023-07-07Paper
Injective edge coloring of sparse graphs with maximum degree 52023-01-17Paper
The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles2023-01-17Paper
Wegner's conjecture on 2-distance coloring for planar graphs2022-07-08Paper
Wegner's conjecture on 2-distance coloring2022-07-01Paper
Injective coloring of planar graphs with girth 52022-05-25Paper
2-Distance coloring of planar graphs without short cycles2021-12-17Paper
https://portal.mardi4nfdi.de/entity/Q50173472021-12-17Paper
没有4- 圈的平面图的BB- 染色2021-12-17Paper
2-Distance coloring of planar graph2021-11-25Paper
https://portal.mardi4nfdi.de/entity/Q49839042021-04-26Paper
r-Hued coloring of planar graphs without short cycles2021-03-18Paper
Injective coloring of planar graphs2021-01-25Paper
https://portal.mardi4nfdi.de/entity/Q51437212021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q51152482020-08-12Paper
List \(r\)-dynamic coloring of sparse graphs2020-04-01Paper
https://portal.mardi4nfdi.de/entity/Q51982042019-10-02Paper
List \(r\)-dynamic coloring of graphs with small maximum average degree2019-03-22Paper
https://portal.mardi4nfdi.de/entity/Q46236632019-02-22Paper
Optimal channel assignment and \(L(p,1)\)-labeling2018-12-07Paper
https://portal.mardi4nfdi.de/entity/Q45586572018-11-29Paper
List injective coloring of a class of planar graphs without short cycles2018-11-14Paper
https://portal.mardi4nfdi.de/entity/Q46904532018-10-22Paper
Minimum 2-distance coloring of planar graphs and channel assignment2018-07-26Paper
Blocking rumor by cut2018-07-20Paper
https://portal.mardi4nfdi.de/entity/Q46428772018-05-25Paper
Injective edge coloring of sparse graphs2018-04-10Paper
Upper bounds for adjacent vertex-distinguishing edge coloring2018-03-01Paper
https://portal.mardi4nfdi.de/entity/Q31310522018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q53715372017-10-20Paper
Backbone coloring for triangle-free planar graphs2017-09-05Paper
Strong edge-coloring of subcubic planar graphs2017-03-07Paper
2-distance coloring of a planar graph without 3, 4, 7-cycles2016-10-20Paper
List injective coloring of planar graphs with girth 52016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29910862016-08-10Paper
List 2-distance coloring of planar graphs without short cycles2016-04-12Paper
List 2-distance coloring of planar graphs2015-11-03Paper
https://portal.mardi4nfdi.de/entity/Q31938452015-10-28Paper
不含3, 4, 8-圈的平面图的2-距离染色2015-10-28Paper
\((1,0,0)\)-colorability of planar graphs without prescribed short cycles2015-09-28Paper
The list 2-distance coloring of a graph with Δ(G) = 52015-07-01Paper
https://portal.mardi4nfdi.de/entity/Q52604192015-06-29Paper
Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles2015-05-22Paper
Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free2015-05-18Paper
Two smaller upper bounds of List injective chromatic number2015-02-16Paper
https://portal.mardi4nfdi.de/entity/Q54982812015-02-11Paper
LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 52014-04-25Paper
List injective coloring of planar graphs with girth 5, 6, 82014-04-16Paper
List backbone colouring of graphs2014-03-27Paper
(\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 62014-01-24Paper
Backbone coloring for graphs with large girths2013-12-03Paper
Upper bounds on vertex distinguishing chromatic indices of some Halin graphs2013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q49009512013-01-24Paper
An optimal square coloring of planar graphs2013-01-03Paper
INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 72012-10-15Paper
On backbone coloring of graphs2012-07-10Paper
https://portal.mardi4nfdi.de/entity/Q31105542012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31095042012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31095232012-01-27Paper
Backbone coloring of planar graphs without special circles2011-12-07Paper
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six2011-09-20Paper
k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS2011-08-02Paper
https://portal.mardi4nfdi.de/entity/Q30170692011-07-19Paper
\(k\)-fold coloring of planar graphs2011-02-25Paper
Relations among some parameters of hypergraphs2011-01-29Paper
Equitable and equitable list colorings of graphs2010-11-11Paper
EQUITABLE COLORING OF 2-DEGENERATE GRAPH AND PLANE GRAPHS WITHOUT CYCLES OF SPECIFIC LENGTHS2010-07-27Paper
https://portal.mardi4nfdi.de/entity/Q35721722010-07-08Paper
Star coloring of sparse graphs2009-12-18Paper
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles2009-12-10Paper
https://portal.mardi4nfdi.de/entity/Q36411112009-11-11Paper
Injective coloring of planar graphs2009-06-30Paper
On the equitable total chromatic number of \(P_n\vee K_{m,n}\)2009-03-06Paper
Equitable list coloring of planar graphs without 4- and 6-cycles2009-01-28Paper
Equitable list colorings of planar graphs without short cycles2008-11-18Paper
Equitable list coloring of planar graphs without 4-and 7-cycles2008-08-06Paper
The relationship between \(BS(H)\) and \(BS(G)\)2007-04-10Paper
On the equitable total chromatic number of two classes of Mycielski graphs and some special planar graphs2007-02-05Paper
https://portal.mardi4nfdi.de/entity/Q54923052006-10-13Paper
Edge-face chromatic number of 2-connected plane graphs with high maximum degree2006-10-05Paper
Some sufficient conditions for a planar graph of maximum degree six to be Class 12006-08-04Paper
https://portal.mardi4nfdi.de/entity/Q33726342006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q46757492005-05-06Paper
https://portal.mardi4nfdi.de/entity/Q49400862000-03-01Paper
On the exponent set of primitive locally semicomplete digraphs1998-04-08Paper
https://portal.mardi4nfdi.de/entity/Q48704421996-05-05Paper
https://portal.mardi4nfdi.de/entity/Q48481831995-09-25Paper

Research outcomes over time

This page was built for person: Yuehua Bu