Wang Weifan

Weifan Wang

Information about the author Weifan Wang will soon be added to the site.
Found 5 papers in total
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
2016
Given a graph G , we study the problem of finding the minimum number of colors...
Acyclic edge coloring of planar graphs without 4‐cycles
Acyclic edge coloring of planar graphs without 4‐cycles
2013
An acyclic edge coloring of a graph G is a proper edge coloring such that no...
Some results on the injective chromatic number of graphs
Some results on the injective chromatic number of graphs
2012
A k ‐coloring of a graph G =( V , E ) is a mapping c : V →{1,2,…, k...
On backbone coloring of graphs
On backbone coloring of graphs
2012
Let G be a graph and H a subgraph of G . A backbone‐ k ‐coloring of ( G...
Acyclic chromatic indices of planar graphs with girth at least five
Acyclic chromatic indices of planar graphs with girth at least five
2012
An acyclic edge coloring of a graph G is a proper edge coloring such that no...
Papers per page: