| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Pakirno barvanje grafa : na študijskem programu 2. stopnje Matematika
Authors:ID Ličina, Tomaž (Author)
ID Dravec, Tanja (Mentor) More about this mentor... New window
Files:.pdf MAG_Licina_Tomaz_2021.pdf (613,60 KB)
MD5: 4AC055439DE1223C1E09402EDCF287F0
PID: 20.500.12556/dkum/af9bc895-96a2-4d29-b5eb-e850cb414fe3
 
.zip MAG_Licina_Tomaz_2021.zip (1,76 MB)
MD5: 1D50D94A65E68A27402910AE0C01BCFD
PID: 20.500.12556/dkum/4bb2c28e-1774-49d9-8c59-418f04830db8
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Pakirno barvanje grafe je dobro barvanje vozlišč, pri katerem sta poljubni dve vozlišči z isto barvo i na razdalji večji kot i. Pakirno kromatično število je najmanjše število barv, ki jih potrebujemo za tako barvanje grafa. V magistrskem delu obravnavamo pakirno kromatično število nekaterih družin grafov in zvezo pakirnega kromatičnega števila z drugimi grafovskimi invariantami. Podrobneje obravnavamo zvezo med kličnim, kromatičnim in pakirnim kromatičnim številom. V prvem delu proučujemo pakirno kromatično število na osnovnih družinah grafov, na drevesih, kartezičnih produktih grafov in na grafih Mycielskega. V naslednjem delu obravnavamo grafe z majhnimi pakirnimi kromatičnimi števili in pokažemo, da je preveriti, ali ima graf pakirno kromatično število enako 4, NP-težek problem. V tretjem delu prikažemo zvezo pakirnega kromatičnega števila z neodvisnostnim številom grafa, najmanjšim vozliščnim pokritjem grafa in maksimalno stopnjo v grafu. V zadnjem delu raziskujemo zvezo med kličnim, kromatičnim in pakirnim kromatičnim številom. Poiščemo trojice naravnih števil (a,b,c) za katere obstaja graf G s kličnim številom a, kromatičnim številom b in pakirnim kromatičnim številom c.
Keywords:barvanje grafov, pakirno barvanje grafov, drevesa, grafi Mycielskega, kartezični produkt grafov, klično število, neodvisnostno število, vozliščno pokritje
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[T. Ličina]
Year of publishing:2021
Number of pages:45 str.
PID:20.500.12556/DKUM-80891 New window
UDC:519.174(043.2)
COBISS.SI-ID:90325763 New window
Publication date in DKUM:12.01.2022
Views:1101
Downloads:82
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
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.

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.
Licensing start date:09.11.2021

Secondary language

Language:English
Title:Packing coloring of graphs
Abstract:Packing coloring of a graph is a proper vertex coloring, where two different vertices with the same color i, are at a distance greater than i. The packing chromatic number of a graph is the smallest number of colors needed to color a graph with such a coloring. In this masters thesis we study the packing chromatic number of certain families of graphs and the relationship between the packing chromatic number and other graph invariants. We investigate the relationship between the clique, the chromatic and the packing chromatic number. In the first part we study the packing chromatic number of basic families of graphs, such as trees, Cartesian products of graphs and on Mycielskian graphs. In the next part we look at graphs with small packing chromatic numbers and show that the problem of checking if a graph is $4$-packing chromatic colorable is NP-hard. In the third part we investigate the relationship between the packing chromatic number and three other graph invariants, the independance number, the smallest vertex cover of a graph and the maximal vertex degree of a graph. In the last part we present the relationship between the clique number, the chromatic number and the packing chromatic number. We present triples (a,b,c) for which there is a graph G with the clique number a, the chromatic number b and the packing chromatic number c.
Keywords:graph coloring, packing coloring of graphs, trees, Mycielskian construction, Cartesian products of graphs, clique number, independance number, vertex cover


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