Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Ciklično barvanje ravninskih grafov : na študijskem programu 2. stopnje Matematika
Authors:
ID
Šneider, Anja
(
Author
)
ID
Jakovac, Marko
(
Mentor
)
More about this mentor...
Files:
MAG_Sneider_Anja_2024.pdf
(2,85 MB)
MD5: FEB7A888EC726E3985D7534B66EB4EF0
Language:
Slovenian
Work type:
Master's thesis/paper
Typology:
2.09 - Master's Thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
V magistrski nalogi predstavimo napredek pri določitvi zgornje meje cikličnega kromatičnega števila ter napredek pri razrešitvi domneve, da za vsak povezan ravninski graf G velja Lχc(G)≤(3/2)∆∗(G)⅃.
Keywords:
Ravninski graf
,
ciklično barvanje
,
ciklično kromatično število
,
domneva o cikličnem barvanju
,
metoda praznjenja.
Place of publishing:
Maribor
Place of performance:
Maribor
Publisher:
[A. Šneider]
Year of publishing:
2024
Number of pages:
VIII, 44 f.
PID:
20.500.12556/DKUM-87725
UDC:
519.172.2(043.2)
COBISS.SI-ID:
194904067
Publication date in DKUM:
09.05.2024
Views:
409
Downloads:
73
Metadata:
Categories:
FNM
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
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 4.0, Creative Commons Attribution 4.0 International
Link:
http://creativecommons.org/licenses/by/4.0/
Description:
This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:
26.03.2024
Secondary language
Language:
English
Title:
Cyclic coloring of planar graphs : magistrsko delo
Abstract:
In this Master's thesis, we present progress in determining the upper bound of cyclic chromatic number and progress in solving the conjecture that for every connected planar graph G Lχc(G)≤(3/2)∆∗(G)⅃.
Keywords:
Planar graph
,
cyclic coloring
,
cyclic chromatic number
,
cyclic coloring conjecture
,
discharging method.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
