| Naslov: | A survey on packing colorings |
|---|
| Avtorji: | ID Brešar, Boštjan (Avtor) ID Ferme, Jasmina (Avtor) ID Klavžar, Sandi (Avtor) ID Rall, Douglas F. (Avtor) |
| Datoteke: | Bresar-2020-A_SURVEY_ON_PACKING_COLORINGS.pdf (98,49 KB) MD5: 472514A70A4C09C93A3C6E62D459DF5B
https://doi.org/10.7151/dmgt.2320
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Znanstveno delo |
|---|
| Tipologija: | 1.02 - Pregledni znanstveni članek |
|---|
| Organizacija: | FNM - Fakulteta za naravoslovje in matematiko PEF - Pedagoška fakulteta
|
|---|
| Opis: | If S=(a1,a2,...) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1,X2,... such that for each pair of distinct vertices in the set Xi, the distance between them is larger than ai. If there exists an integer k such that V(G)=X1 U ... U Xk, then the partition is called an S-packing k-coloring. The S-packing chromatic number of G is the smallest k such that G admits an S-packing k-coloring. If ai=i for every i, then the terminology reduces to packing colorings and packing chromatic number. Since the introduction of these generalizations of the chromatic number in 2008 more than fifty papers followed. Here we survey the state of the art on the packing coloring, and ts generalization, the S-packing coloring. We also list several conjecres and open problems. |
|---|
| Ključne besede: | packing coloring, packing chromatic number, subcubic graph, S-packing chromatic number, computational complexity |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Poslano v recenzijo: | 31.01.2020 |
|---|
| Datum sprejetja članka: | 08.04.2020 |
|---|
| Založnik: | Technical University Press |
|---|
| Leto izida: | 2020 |
|---|
| Št. strani: | Str. 923-970 |
|---|
| Številčenje: | Letn. 40, št. 4 |
|---|
| PID: | 20.500.12556/DKUM-92011  |
|---|
| UDK: | 519.17 |
|---|
| COBISS.SI-ID: | 23220483  |
|---|
| DOI: | 10.7151/dmgt.2320  |
|---|
| ISSN pri članku: | 1234-3099 |
|---|
| Datum objave v DKUM: | 11.03.2025 |
|---|
| Število ogledov: | 282 |
|---|
| Število prenosov: | 21 |
|---|
| Metapodatki: |  |
|---|
| Področja: | Ostalo
|
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Skupna ocena: | (0 glasov) |
|---|
| Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
|---|
| Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |