- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Distinguishing vertices of a graph: automorphisms and...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Distinguishing vertices of a graph: automorphisms and palettes Wozniak, Mariusz
Description
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.
Item Metadata
Title |
Distinguishing vertices of a graph: automorphisms and palettes
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2018-09-17T15:16
|
Description |
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.
|
Extent |
36.0
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: AGH University of Science and Technology
|
Series | |
Date Available |
2019-03-17
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0377013
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International