[1]
|
T. Panyukova, “Cover with Ordered Enclosing for Flat Graphs,” Electronic Notes in Discrete Mathematics, Vol. 28, 2007, pp. 17-24. doi:10.1016/j.endm.2007.01.004
|
[2]
|
T. Pisanski, T. W. Tucker and A. Zitnik, “Straight-Ahead walks in Eulerian Graphs,” Discrete Mathematics, Vol. 281, No. 1-3, 2004, pp. 237-246.
doi:10.1016/j.disc.2003.09.011
|
[3]
|
H. Fleischner, “Eulerian Graphs and Related Topics,” Part 1, Vol. 1, Elsevier, Amsterdam, 1990.
|
[4]
|
H. Fleischner, “Eulerian Graphs and Related Topics,” Part 1, Vol. 2, Elsevier, Amsterdam, 1991.
|
[5]
|
H. Fleischner, L. W. Beineke and R. J. Wilson, “Eulerian Graphs, Selected Topics in Graph Theory 2,” Academic Press, London, New York, 1983, pp. 17-53.
|
[6]
|
D. Chebikin, “On k-Edge-Ordered Graphs,” Discrete Mathematics, Vol. 281, No. 1-3, 2004, pp. 115-128.
doi:10.1016/j.disc.2003.09.004
|
[7]
|
S. Szeider, “Finding Paths in Graphs Avoiding Forbidden Transitions,” Discrete Applied Mathematics, Vol. 126, No. 2-3, 2003, pp. 261-273.
doi:10.1016/S0166-218X(02)00251-2
|
[8]
|
A. Kotzig, “Moves without Forbidden Transitions in a Graph,” Matematicky Casopis, Vol. 18, No. 1, 1968, pp. 76-80.
|
[9]
|
T. A. Panyukova, “The Paths with Local Restrictions,” Reports of South Ural State University. Section: Mathematical Modelling and Programming, Vol. 5, No. 16, 2010, pp. 58-67 (in Russian).
|