Name
Abstract | ||
|---|---|---|
A packing k-coloring of a graph G is a k-coloring such that the distance between two vertices having color i is at least i+1. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.dam.2012.08.008 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Packing chromatic number,Partner limited graph,Lobster,Caterpillar | Discrete mathematics,Combinatorics,Indifference graph,Chordal graph,Chromatic polynomial,Pathwidth,1-planar graph,Mathematics,Metric dimension,Split graph,Graph coloring | Journal |
Volume | ISSN | Citations |
164 | 0166-218X | 2 |
PageRank | References | Authors |
0.42 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gabriela R. Argiroffo | 1 | 43 | 10.52 |
| G. Nasini | 2 | 2 | 0.42 |
| Pablo Torres | 3 | 16 | 4.81 |