Yuehua Bu

Orcid: 0000-0001-9618-2248

According to our database1, Yuehua Bu authored at least 53 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Injective-edge-coloring of planar graphs with girth restriction.
Discret. Math. Algorithms Appl., July, 2024

Injective chromatic index of sparse graphs.
Discret. Appl. Math., March, 2024

Injective edge chromatic number of sparse graphs.
Appl. Math. Comput., 2024

2023
2-Distance coloring of planar graphs without adjacent 5-cycles.
J. Comb. Optim., July, 2023

2-Distance coloring of planar graphs without triangles and intersecting 4-cycles.
Discret. Math. Algorithms Appl., February, 2023

Injective edge coloring of sparse graphs with maximum degree 5.
J. Comb. Optim., 2023

The r-dynamic chromatic number of planar graphs without 4-, 5-cycles.
J. Comb. Optim., 2023

2022
Wegner's Conjecture on 2-distance coloring for planar graphs.
Theor. Comput. Sci., 2022

The r-Dynamic Chromatic Number of Planar Graphs Without Special Short Cycles.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

Injective Edge Coloring of Power Graphs and Necklaces.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Injective coloring of planar graphs.
Theor. Comput. Sci., 2021

Wegner's Conjecture on 2-Distance Coloring.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
List <i>r</i>-dynamic coloring of sparse graphs.
Theor. Comput. Sci., 2020

r-Hued coloring of planar graphs without short cycles.
Discret. Math. Algorithms Appl., 2020

Injective Coloring of Halin Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
List r-dynamic coloring of graphs with small maximum average degree.
Discret. Appl. Math., 2019

2018
Optimal channel assignment and L(p, 1)-labeling.
J. Glob. Optim., 2018

Upper bounds for adjacent vertex-distinguishing edge coloring.
J. Comb. Optim., 2018

Minimum 2-distance coloring of planar graphs and channel assignment.
J. Comb. Optim., 2018

Blocking Rumor by Cut.
J. Comb. Optim., 2018

Injective edge coloring of sparse graphs.
Discret. Math. Algorithms Appl., 2018

List injective coloring of a class of planar graphs without short cycles.
Discret. Math. Algorithms Appl., 2018

List injective Coloring of Planar Graphs.
Ars Comb., 2018

Channel Assignment with r-Dynamic Coloring.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017
Strong edge-coloring of subcubic planar graphs.
Discret. Math. Algorithms Appl., 2017

2016
2-Distance coloring of a planar graph without 3, 4, 7-cycles.
J. Comb. Optim., 2016

List 2-distance coloring of planar graphs without short cycles.
Discret. Math. Algorithms Appl., 2016

2015
Backbone coloring of planar graphs for C8-free or C9-free.
Theor. Comput. Sci., 2015

List 2-distance coloring of planar graphs.
J. Comb. Optim., 2015

(1, 0, 0)-Colorability of planar graphs without prescribed short cycles.
J. Comb. Optim., 2015

Two smaller upper bounds of list injective chromatic number.
J. Comb. Optim., 2015

Equitable List-Coloring for C 5-Free Plane Graphs Without Adjacent Triangles.
Graphs Comb., 2015

The list 2-distance coloring of a graph with Δ(G) = 5.
Discret. Math. Algorithms Appl., 2015

2014
List Injective Coloring of Planar graphs with girth G ≥ 5.
Discret. Math. Algorithms Appl., 2014

List backbone colouring of graphs.
Discret. Appl. Math., 2014

2013
Backbone coloring for graphs with large girths.
Discret. Math., 2013

(1, 1, 0)-coloring of planar graphs without cycles of length 4 and 6.
Discret. Math., 2013

List injective coloring of planar graphs with girth 5, 6, 8.
Discret. Appl. Math., 2013

2012
On backbone coloring of graphs.
J. Comb. Optim., 2012

An optimal square coloring of planar graphs.
J. Comb. Optim., 2012

Injective Coloring of Planar Graphs with girth 7.
Discret. Math. Algorithms Appl., 2012

2011
Backbone coloring of planar graphs without special circles.
Theor. Comput. Sci., 2011

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six.
Discuss. Math. Graph Theory, 2011

k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS.
Discret. Math. Algorithms Appl., 2011

2010
Equitable and equitable list colorings of graphs.
Theor. Comput. Sci., 2010

Equitable Coloring of 2-degenerate Graph and Plane Graphs without cycles of Specific lengths.
Discret. Math. Algorithms Appl., 2010

2009
Star coloring of sparse graphs.
J. Graph Theory, 2009

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.
Discret. Math., 2009

Equitable list coloring of planar graphs without 4- and 6-cycles.
Discret. Math., 2009

Injective coloring of planar graphs.
Discret. Appl. Math., 2009

2008
Equitable list colorings of planar graphs without short cycles.
Theor. Comput. Sci., 2008

Multicoloring the Mycielskian of Graphs.
Proceedings of the 2008 IEEE International Conference on Granular Computing, 2008

2006
Some sufficient conditions for a planar graph of maximum degree six to be Class 1.
Discret. Math., 2006


  Loading...