Name
Title | ||
|---|---|---|
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. |
Abstract | ||
|---|---|---|
An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by Χ′ a(G). We prove that Χ′a(G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges whose girth is at least 6. This gives new evidence to a conjecture proposed in [Z. Zhang, L. Liu, and J.Wang, Adjacent strong edge coloring of graphs, Appl. Math. Lett., 15 (2002) 623-626.]. |
Year | DOI | Venue |
|---|---|---|
2011 | null | Discussiones Mathematicae - Graph Theory |
Keywords | Field | DocType |
edge-coloring,planar graph,vertex-distinguishing,edge coloring | Edge coloring,Discrete mathematics,Combinatorics,Loop (graph theory),Vertex (graph theory),Planar straight-line graph,Neighbourhood (graph theory),Nowhere-zero flow,1-planar graph,Mathematics,Graph coloring | Journal |
Volume | Issue | Citations |
31 | 3 | 10 |
PageRank | References | Authors |
0.75 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuehua Bu | 1 | 112 | 19.84 |
| Ko-wei Lih | 2 | 529 | 58.80 |
| Weifan Wang | 3 | 868 | 89.92 |