Group colloquium: Compatible spanning circuits in edge-colored graphs
When: May 2, 2019, 15:45-16:30
Who: Zhiwei Guo
A spanning circuit of a graph is defined as a closed trail visiting each vertex of the graph. A compatible spanning circuit of an edge-colored graph refers to a spanning circuit in which each pair of edges traversed consecutively along the spanning circuit have distinct colors. In this talk, I will present some sufficient conditions for the existence of compatible spanning circuits in some edge-colored graphs.