| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Barvanje povezav grafa z najmanjšim številom palet : na študijskem programu Izobraževalna matematika in izobraževalno računalništvo
Authors:ID Bregač, Karmen (Author)
ID Vesel, Aleksander (Mentor) More about this mentor... New window
Files:.pdf EMAG_Bregac_Karmen_2023.pdf (5,34 MB)
MD5: 2E4B19379B29AD18F4EF9BF7F05FDF71
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V magistrskem delu obravnavamo paletno barvanje povezav in paletni indeks različnih družin grafov. Dobro barvanje povezav je barvanje, pri katerem velja, da nobeni incidenčni povezavi nista pobarvani z enako barvo. Dobro barvanje povezav grafa za vsako vozlišče definira množico barv incidenčnih povezav. Takšno množico imenujemo paleta vozlišča. V literaturi se avtorji večinoma osredotočajo na barvanje povezav grafov, pri katerem je uporabljeno največje možno število palet. Mi se bomo osredotočili na iskanje takšnega barvanja povezav grafa, za katerega bo veljalo, da je barvanje dobro in pri katerem bo uporabljeno najmanjše možno število palet, ki ga imenujemo paletni indeks grafa. Na začetku spoznamo osnove teorije grafov, ki nam pomagajo pri nadaljnjem razumevanju teorije. V osrednjem delu magistrske dela ugotovimo, da nas dobro barvanje z najmanjšim številom možnih barv ne pripelje vedno do najmanjšega števila palet. Spoznamo tudi, kako poiskati paletne indekse nekaterih znanih družin grafov in posebnih primerov grafov, pri katerih namesto minimalnega barvanja povezav uporabimo barvanje z večjim številom barv.
Keywords:Barvanje povezav, paletno barvanje povezav, paletni indeks.
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[K. Bregač]
Year of publishing:2023
Number of pages:48 str.
PID:20.500.12556/DKUM-84694 New window
UDC:519.17(043.2)
COBISS.SI-ID:163623427 New window
Publication date in DKUM:07.09.2023
Views:578
Downloads:57
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:24.07.2023

Secondary language

Language:English
Title:Minimum number of palettes in edge coloring : magistrsko delo
Abstract:In the following master's thesis, we discuss the palette coloring of the edges and palette index of different types of graphs. A proper edge coloring of edges is a coloring where no two incident edges are colored with the same color. Proper edge coloring of a graph defines for each node a set of colored edges, which is called a palette of the vertex. In many scientific papers, authors are focusing on finding proper edge coloring with the largest possible number of palettes. However, we will focus on finding a proper edge coloring using the smallest possible number of palettes, which we call the palette index of a graph. At the beginning of the thesis, we are talking about the basics of graph theory, which help us to understand the theory further. In the main part of the master's thesis, we learn that a proper coloring with the smallest number of possible colors does not always lead us to the smallest number of palettes. We also learn how to find the palette index of known graphs and particular examples of graphs where we use a coloring with a larger number of colors than minimal.
Keywords:Edge coloring, palette edge coloring, palette index.


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