Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems. - Zhiwei Guo 003; Xueliang Li 001; Chuandong Xu; Shenggui Zhang (Discret. Math., 2018)

Compatible spanning circuits in edge-colored graphs. - Zhiwei Guo 003; Binlong Li; Xueliang Li 001; Shenggui Zhang (Discret. Math., 2020)

Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. - Zhiwei Guo 003; Hajo Broersma; Ruonan Li; Shenggui Zhang (J. Comb. Optim., 2020)

Almost eulerian compatible spanning circuits in edge-colored graphs. - Zhiwei Guo 003; Hajo Broersma; Binlong Li; Shenggui Zhang (Discret. Math., 2021)

Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. - Yuhang Bai; Zhiwei Guo 003; Shenggui Zhang; Yandong Bai (J. Comb. Optim., 2023)

Compatible Spanning Circuits Visiting Each Vertex Exactly a Specified Number of Times in Graphs with Generalized Transition Systems. - Zhiwei Guo 003; Xiaoxia Chen (Parallel Process. Lett., 2024)

Rainbow transitive triangles in arc-colored digraphs. - Mengyu Duan; Zhiwei Guo 003; Binlong Li; Shenggui Zhang (Discret. Appl. Math., 2025)

On proper hamiltonicity and proper (even) pancyclicity of arc-colored complete (balanced bipartite) digraphs. - Mengyu Duan; Zhiwei Guo 003; Binlong Li; Shenggui Zhang (Discret. Math., 2025)