Name
Abstract | ||
|---|---|---|
Let G be a plane graph. A facial path of G is any path which is a consecutive part of the boundary walk of a face of G. Two edges e1 and e2 of G are facially adjacent if they are consecutive on a facial path of G. Two edges e1 and e3 are facially semi-adjacent if they are not facially adjacent and there is a third edge e2 which is facially adjacent with both e1 and e3, and the edges e1,e2,e3 are consecutive (in this order) on a facial path. An edge-labeling of G with labels 1,2,…,k is a facial L(2,1)-edge-labeling if facially adjacent edges have labels which differ by at least 2 and facially semi-adjacent edges have labels which differ by at least 1. The minimum k for which a plane graph admits a facial L(2,1)-edge-labeling is called the facial L(2,1)-edge-labeling index. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.dam.2018.03.081 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Plane graph,Boundary walk,Edge-labeling,
L(2,1)-edge-labeling | Discrete mathematics,Combinatorics,Vertex (geometry),Upper and lower bounds,Mathematics,Planar graph | Journal |
Volume | ISSN | Citations |
247 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Július Czap | 1 | 80 | 15.40 |
| Stanislav Jendrol’ | 2 | 67 | 7.66 |
| Juraj Valiska | 3 | 0 | 0.68 |