Name
Abstract | ||
|---|---|---|
A facial packing vertex-coloring of a plane graph G is a coloring of its vertices with colors 1,…,k such that every facial path containing two vertices with the same color i has at least i+2 vertices. The smallest positive integer k such that G admits a facial packing vertex-coloring with colors 1,…,k is denoted by pf(G). Let Si(G) denote the graph obtained from G by subdividing each of its edges precisely i times, i≥0. In this paper we deal with a question whether pf(Si(G)) is bounded. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2018.10.022 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Plane graph,Subdivision,Vertex-coloring | Integer,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Mathematics,Planar graph,Bounded function | Journal |
Volume | ISSN | Citations |
257 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Július Czap | 1 | 80 | 15.40 |
| Stanislav Jendrol’ | 2 | 67 | 7.66 |
| Peter Šugerek | 3 | 4 | 1.47 |
| Juraj Valiska | 4 | 0 | 0.68 |