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

Ruonan Li, Hajo Broersma (Corresponding Author), Shenggui Zhang

    Research output: Contribution to journalArticleAcademicpeer-review

    7 Citations (Scopus)
    65 Downloads (Pure)


    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.
    Original languageEnglish
    Pages (from-to)261-286
    Number of pages26
    JournalGraphs and combinatorics
    Issue number1
    Publication statusPublished - 2 Jan 2019


    • UT-Hybrid-D


    Dive into the research topics of 'Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs'. Together they form a unique fingerprint.

    Cite this