Funder
NSFC
Natural Science Foundation of Shaanxi Province
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference22 articles.
1. Benkouar A, Manoussakis Y, Paschos VT, Saad R (1996) Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs: Some complexity results. RAIRO Oper Res 30:417–438
2. Bondy JA, Murty USR (2008) Graph theory. Springer, New York
3. Brightwell GR, Winkler P (2004) Note on counting Eulerian circuits, CDAM Research Report LSE-CDAM-2004-12
4. Conte A, Grossi R, Loukides G, Pisanti N, Pissis SP, Punzi G (2020) Fast assessment of eulerian trails, In: Fourth international workshop on enumeration problems and applications
5. Fleischner H, Fulmek M (1990) P(D)-compatible eulerian trails in digraphs and a new splitting lemma, Contemp Methods Graph Theory, 291–303