Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs

With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We show that properly edge-colored theta graphs play a key role in characterizing the difference between edge-colored complete graphs and multipartite tournaments. We also establish sufficient conditions for an edge-colored complete graph to contain a small and a large properly edge-colored theta graph, respectively