Some Conditions for the Existence of Euler H-trails
暂无分享,去创建一个
Hortensia Galeana-Sánchez | Rocío Rojas-Monroy | Rocio Sanchez-Lopez | Juana Imelda Villarreal-Valdés | H. Galeana-Sánchez | Rocío Sánchez-López | R. Rojas-Monroy | J. I. Villarreal-Valdés
[1] Pavel A. Pevzner,et al. Computational molecular biology : an algorithmic approach , 2000 .
[2] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[3] David P. Sumner,et al. Graphs with 1-factors , 1974 .
[4] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .
[5] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[6] Gregory Gutin,et al. Chinese Postman Problem on edge-colored multigraphs , 2015, Discret. Appl. Math..
[7] Emanuel Wenger,et al. Transforming eulerian trails , 1992, Discret. Math..
[8] Václav Linek,et al. Reachability problems in edge-colored digraphs , 2007, Discret. Math..
[9] Keith W. Hipel,et al. Using matrices to link conflict evolution and resolution in a graph model , 2010, Eur. J. Oper. Res..
[10] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.
[11] Jacek Blazewicz,et al. An assignment walk through 3D NMR spectrum , 2009, 2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology.
[12] Yannis Manoussakis,et al. Paths through fixed vertices in edge-colored graphs , 1993 .
[13] A. Kotzig. Moves Without Forbidden Transitions in a Graph , 1968 .
[14] Keith W. Hipel,et al. A matrix approach to status quo analysis in the graph model for conflict resolution , 2009, Appl. Math. Comput..
[15] Sandeep Kour Ahuja,et al. Algorithms for Routing and channel Assignment in Wireless Infrastructure Networks , 2010 .
[16] Pavel A. Pevzner,et al. DNA physical mapping and alternating Eulerian cycles in colored graphs , 1995, Algorithmica.
[17] Bill Sands,et al. A note on paths in edge-coloured tournaments , 1996, Ars Comb..
[18] Hortensia Galeana-Sánchez,et al. H-kernels and H-obstructions in H-colored digraphs , 2015, Discret. Math..
[19] J. Petersen. Die Theorie der regulären graphs , 1891 .
[20] Giovanni Felici,et al. The Orderly Colored Longest Path Problem - a survey of applications and new algorithms , 2014, RAIRO Oper. Res..
[21] I-Lun Tseng,et al. Obstacle-Aware Longest-Path Routing with Parallel MILP Solvers , 2010 .
[22] Hortensia Galeana-Sánchez,et al. H-Paths and H-Cycles in H-Coloured Digraphs , 2015, Graphs Comb..