| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:A survey on packing colorings
Authors:ID Brešar, Boštjan (Author)
ID Ferme, Jasmina (Author)
ID Klavžar, Sandi (Author)
ID Rall, Douglas F. (Author)
Files:.pdf Bresar-2020-A_SURVEY_ON_PACKING_COLORINGS.pdf (98,49 KB)
MD5: 472514A70A4C09C93A3C6E62D459DF5B
 
URL https://doi.org/10.7151/dmgt.2320
 
Language:English
Work type:Scientific work
Typology:1.02 - Review Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
PEF - Faculty of Education
Abstract: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.
Keywords:packing coloring, packing chromatic number, subcubic graph, S-packing chromatic number, computational complexity
Publication status:Published
Publication version:Version of Record
Submitted for review:31.01.2020
Article acceptance date:08.04.2020
Publisher:Technical University Press
Year of publishing:2020
Number of pages:Str. 923-970
Numbering:Letn. 40, št. 4
PID:20.500.12556/DKUM-92011 New window
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:23220483 New window
DOI:10.7151/dmgt.2320 New window
Publication date in DKUM:11.03.2025
Views:279
Downloads:21
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARRS - Slovenian Research Agency
Project number:J1-9109
Name:Sodobne invariante grafov

Funder:ARRS - Slovenian Research Agency
Project number:J1-1693
Name:Sodobni in novi metrični koncepti v teoriji grafov

Funder:ARRS - Slovenian Research Agency
Project number:N1-0095
Name:Turanova števila in ekstremalni problemi za poti

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Secondary language

Language:Slovenian
Title:Pregledni članek o pakirnih barvanjih
Abstract:Če je S=(a1,a2,...) nepadajoče zaporedje naravnih števil, potem je S-pakirno barvanje grafa G taka particija množice vozlišč V(G) na množice X1,X2,..., da je razdalja med vsakima različnima vozliščema poljubne množice Xi večja kot ai. Če obstaja tako število k, da je V(G)=X1 U ... U Xk, potem particijo imenujemo S-pakirno k-barvanje. Najmanjše tako število k, da G premore S-pakirno k-barvanje imenujemo S-pakirno kromatično število grafa G. Če je ai=i za vsa naravna števila i, potem se izraza poenostavita v pakirno barvanje in pakirno kromatično število. Od vpeljave teh posplošitev kromatičnega števila v letu 2008 je bilo objavljenih preko 50 člankov na to temo. V tem članku naredimo pregled stanja na področju pakirnih barvanj in njihovih posplošitev S-pakirnih barvanj. Predstavimo tudi več odprtih problemov in domnev.
Keywords:pakirno barvanje, pakirno kromatično število, podkubični graf, S-pakirno kromatično število, računska zahtevnost


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica