Zpět na vyhledávání

Bc. Lukáš Málik

Bachelor's thesis

Conflict-free colouring of planar graphs

Conflict-free colouring of planar graphs
Abstract:
V tejto práci uvádzame prehľad niekoľkých špecifických variant na conflict-free coloring a ako súvisia s planárnymi grafmi. Taktiež sa chceme sústrediť na ohraničenie chromatických čísel pre rozoberané typy ofarbení planárnych a outerplanárnych grafov. Primárne budeme demonštrovať najlepšie ohraničenia spolu so sprevádzajúcimi dôkazmi. Ukážeme niekoľko otvorených problémov a dva originálne výsledky …more
Abstract:
In this thesis, we will give an overview of a few specific variants of conflict-free coloring and how they relate to planar and outerplanar graphs. We will focus on the bounds of chromatic numbers for the discussed colorings on planar and outerplanar graphs, mainly demon- strating the currently best bounds along with an accompanying proof. We will also show some open problems and present two original …more
 

Keywords

Conflict-free coloring proper conflict-free coloring planar graphs outerplanar graphs neighborhoods chromatic numbers
 
Language used: English
Date on which the thesis was submitted / produced: 18. 5. 2023
Identifier: https://is.muni.cz/th/tzjad/

Thesis defence

  • Date of defence: 30. 6. 2023
  • Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
  • Reader: PhD Grzegorz Jan Guspiel

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Bachelor programme / field:
Informatics / Informatics

Theses on a related topic

List of theses with an identical keyword.
  • No theses on a related topic available.