"Non UBC"@en .
"DSpace"@en .
"Wozniak, Mariusz"@en .
"2019-03-17T02:02:53Z"@en .
"2018-09-17T15:16"@en .
"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\nautomorphisms, or coloring that induces different color palettes for each vertex.\n\nThese 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.\n\nWe will show several situations when the corresponding parameters are close to each other.\n\nThe talk is based on the papers [1] and [2].\n\n[1] R. Kalinowski, M. Pil\u00C5 niak, J. Przyby\u00C5 o and M. Wo\u00C5\u00BAniak, How to personalize the vertices of a graph, European Journal of Combinatorics 40 (2014), 116-123.\n\n[2] R. Kalinowski, M. Pil\u00C5 niak, M. Wo\u00C5\u00BAniak, Distinguishing graphs by total colourings, Ars Mathematica Contemporanea 11 (2016), 79-89."@en .
"https://circle.library.ubc.ca/rest/handle/2429/68826?expand=metadata"@en .
"36.0"@en .
"video/mp4"@en .
""@en .
"Author affiliation: AGH University of Science and Technology"@en .
"Oaxaca (Mexico : State)"@en .
"10.14288/1.0377013"@en .
"eng"@en .
"Unreviewed"@en .
"Vancouver : University of British Columbia Library"@en .
"Banff International Research Station for Mathematical Innovation and Discovery"@en .
"Attribution-NonCommercial-NoDerivatives 4.0 International"@en .
"http://creativecommons.org/licenses/by-nc-nd/4.0/"@en .
"Faculty"@en .
"BIRS Workshop Lecture Videos (Oaxaca (Mexico : State))"@en .
"Mathematics"@en .
"Combinatorics"@en .
"Group theory and generalizations"@en .
"Discrete mathematics"@en .
"Distinguishing vertices of a graph: automorphisms and palettes"@en .
"Moving Image"@en .
"http://hdl.handle.net/2429/68826"@en .