Bezkonfliktní barvení
| Thesis title in Czech: | Bezkonfliktní barvení |
|---|---|
| Thesis title in English: | Proper conflict-free coloring |
| Key words: | bezkonfliktní barvení|grafy|barvení |
| English key words: | conflict-free coloring|graphs|coloring |
| Academic year of topic announcement: | 2023/2024 |
| Thesis type: | Bachelor's thesis |
| Thesis language: | čeština |
| Department: | Computer Science Institute of Charles University (32-IUUK) |
| Supervisor: | prof. Mgr. Zdeněk Dvořák, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 19.09.2023 |
| Date of assignment: | 19.09.2023 |
| Confirmed by Study dept. on: | 22.09.2023 |
| Date and time of defence: | 11.02.2025 10:30 |
| Date of electronic submission: | 09.01.2025 |
| Date of submission of printed version: | 09.01.2025 |
| Date of proceeded defence: | 11.02.2025 |
| Opponents: | doc. Mgr. Robert Šámal, Ph.D. |
| Guidelines |
| Proper conflict-free coloring is a proper coloring with the additional constraint that on the open neighborhood of every vertex, at least one of the colors appears exactly once. This variation on proper coloring was introduced recently and there are many open questions concerning it, e.g., determining the maximum value of proper conflict-free chromatic number of planar graphs. The thesis will survey the current state of knowledge on this topic and attempt to obtain new results. |
| References |
| Igor Fabrici, Borut Lužar, Simona Rindošová, Roman Soták: Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods, Discrete Applied Mathematics 324 (2023), 80-92
Yair Caro, Mirko Petruševski, Riste Škrekovski: Remarks on proper conflict-free colorings of graphs, Discrete Mathematics 346 (2023), 113221 a další časopisecká. |