| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Pakirna barvanja nekaterih razredov grafov z rekurzivno strukturo : doktorska disertacija
Authors:ID Ferme, Jasmina (Author)
ID Brešar, Boštjan (Mentor) More about this mentor... New window
Files:.pdf DOK_Ferme_Jasmina_2022.pdf (694,86 KB)
MD5: 2866D749B21DE5FF38263EB10EDF3847
PID: 20.500.12556/dkum/20522540-fcd8-4081-b79e-c736eee48110
 
Language:Slovenian
Work type:Doctoral dissertation
Typology:2.08 - Doctoral Dissertation
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V doktorski disertaciji obravnavamo pakirna barvanja grafov. Ta predstavljajo eno izmed zelo raziskovanih variacij barvanj grafov. Doktorska disertacija je sestavljena iz treh delov, v sklopu katerih predstavimo rešitve različnih problemov v zvezi s pakirnimi barvanji. Omenjene probleme povezuje dejstvo, da pri njihovi obravnavi nastopajo grafi z rekurzivno strukturo. Ti predstavljajo temelj danega odprtega vprašanja, rešitev slednjega ali pa je njihova rekurzivna zgradba pomembno sredstvo pri dokazovanju spoznanj. V prvem delu disertacije predstavimo neskončno družino podkubičnih grafov z neomejenim pakirnim kromatičnim številom. Dodatna lastnost omenjene družine grafov je njena rekurzivna zgradba. S predstavitvijo omenjene družine grafov dopolnimo rešitev več let odprtega vprašanja glede omejenosti pakirnega kromatičnega števila v družini podkubičnih grafov. V drugem delu disertacije določamo pakirna kromatična števila (oziroma meje zanje) grafov tipa Sierpińskega, ki sodijo med najbolj znane razrede grafov z rekurzivno oziroma fraktalno strukturo. Omejimo se na obravnavo grafov Sierpińskega, posplošenih grafov Sierpińskega ter trikotnikov Sierpińskega. Zadnji del doktorske disertacije namenjamo obravnavi grafov, ki so kritični za pakirno kromatično število. Med drugim podamo karakterizacije pakirno kromatično kritičnih grafov z majhnimi pakirnimi kromatičnimi števili ter obravnavamo pakirno kromatično kritične bločne grafe.
Keywords:Barvanje, pakirno barvanje, pakirno kromatično število, kubični graf, graf Sierpińskega, trikotnik Sierpińskega, kritičen graf, pakirno kromatično-vozliščno kritičen graf, pakirno kromatično kritičen graf
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[J. Ferme]
Year of publishing:2022
Number of pages:IX f, 128 str.
PID:20.500.12556/DKUM-81029 New window
UDC:519.17(043.3)
COBISS.SI-ID:104015875 New window
Publication date in DKUM:07.04.2022
Views:1238
Downloads:99
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.12.2021

Secondary language

Language:English
Title:Packing Coloring of Some Classes of Graphs with Recursive Structure
Abstract:This dissertation examines the packing colorings of graphs. These colorings are among the well-studied variants of graph colorings. The dissertation consists of three parts, in which we present the solutions to various problems related to packing colorings. The common ground of the mentioned problems is that in their treatment graphs with a recursive structure appear. These graphs are either the basis of a given open question, its solution, or their recursive structure is an important tool in proving the results. In the first part of the dissertation, we present an infinite family of subcubic graphs with unbounded packing chromatic number. An additional property of the mentioned family of graphs is its recursive structure. By providing this family of graphs, we complete the solution to a question that has been open for several years regarding the boundedness of the packing chromatic number in the family of subcubic graphs. In the second part, we determine the packing chromatic numbers (or bounds) of Sierpiński-type graphs, which form a well-known class of graphs with recursive (fractal) structure. We consider Sierpiński graphs, generalized Sierpiński graphs, and Sierpiński triangle graphs. The last part of the dissertation is devoted to the graphs that are critical for the packing chromatic number. Among other things, we present characterizations of packing chromatic critical graphs with small packing chromatic numbers, and discuss packing chromatic critical block graphs.
Keywords:Coloring, packing coloring, packing chromatic number, cubic graph, Sierpiński graph, Sierpiński triangle graph, critical graph, packing chromatic-vertex critical graph, packing chromatic critical graph


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