Cyclical codes and operations on graphs
Jurij Kovi\v c
IMFM, UP FAMNIT
Minisymposium: GENERAL SESSION TALKS
Content: This talk will reveal a natural correspondence between rhombic tilings of planar polygonal regions and circle graphs. This correspondence leads to a simple coding of graphs with cyclical sequences that can be used for the classification of graphs. Using this code we can define also various new operations on graphs.