|
|
|
|
Список литературы
|
|
| |
| 1. |
T. A. Panioukova, A. V. Panyukov, “Algorithms for Construction of Ordered Enclosing Traces in Planar Eulerian Graphs”, The International Workshop on Computer Science and Information Technologies'2003, Proceedings of Workshop (Ufa, September 16–18, 2003), v. 1, Ufa State Technical University, Ufa, 2003, 134–138 |
| 2. |
T. Pisanski, T. W. Tucker, A. Zitnik, “Straight-ahead walks in Eulerian graphs”, Discrete Mathematics, 281 (2004), 237–246     |
| 3. |
Г. Фляйшнер, Эйлеровы графы и смежные вопросы, Мир, М., 2002, 335 с., ил. |
| 4. |
H. Fleischner, Eulerian Graphs and Related Topics, Part 1, v. 2, Ann. Discrete Mathematics, 50, 1991 |
| 5. |
H. Fleischner, L. W. Beineke, R. J. Wilson, “Eulerian Graphs”, Selected Topics in Graph Theory, v. 2, Academic Press, London–New York, 1983, 17–53 |
| 6. |
D. Chebikin, “On k-edge-ordered graphs”, Discrete Mathematics, 281 (2004), 115–128 |
| 7. |
S. Szeider, “Finding Paths in Graphs Avoiding Forbidden Transitions”, Discrete Applied Mathematics, 126 (2003), 261–273 |
| 8. |
A. Kotzig, “Moves Without Forbidden Transitions in a Graph”, Mat.-Fiz. Casopis, 18:1 (1968), 76–80 |
| 9. |
Т. А. Панюкова, В. Ф. Мирасов, “Построение совместимых цепей в графах”, Проблемы теоретической и прикладной математики, Тр. 39-й Регион. молодеж. конф. (Екатеринбург, 2008), 38–43 |
