Non UBC
DSpace
Wozniak, Mariusz
2019-03-17T02:02:53Z
2018-09-17T15:16
If we want to distinguish all vertices of the graph by coloring its elements, then we have the following possibilities. We can use the concept of coloring that breaks non-trivial
automorphisms, or coloring that induces different color palettes for each vertex.
These approaches are not independent. Always distinguishing using automorphisms is stronger than using palettes. And, very often, the corresponding parameters are quite distant from each other.
We will show several situations when the corresponding parameters are close to each other.
The talk is based on the papers [1] and [2].
[1] R. Kalinowski, M. PilÅ niak, J. PrzybyÅ o and M. WoÅºniak, How to personalize the vertices of a graph, European Journal of Combinatorics 40 (2014), 116-123.
[2] R. Kalinowski, M. PilÅ niak, M. WoÅºniak, Distinguishing graphs by total colourings, Ars Mathematica Contemporanea 11 (2016), 79-89.
https://circle.library.ubc.ca/rest/handle/2429/68826?expand=metadata
36.0
video/mp4
Author affiliation: AGH University of Science and Technology
Oaxaca (Mexico : State)
10.14288/1.0377013
eng
Unreviewed
Vancouver : University of British Columbia Library
Banff International Research Station for Mathematical Innovation and Discovery
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
Faculty
BIRS Workshop Lecture Videos (Oaxaca (Mexico : State))
Mathematics
Combinatorics
Group theory and generalizations
Discrete mathematics
Distinguishing vertices of a graph: automorphisms and palettes
Moving Image
http://hdl.handle.net/2429/68826