BÖHME, Thomas - HARANT, Jochen - TKÁČ, Michal. On Certain Hamiltonian Cycles in Planar Graphs. In Journal of graph theory. - USA : John Wiley & Sons, 1999. ISSN 0364-9024, September 1999, vol. 32, no. 1, pp. 81-96
Ohlasy:
[1] LIU, Xiaonan - YU, Xingxing. NUMBER OF HAMILTONIAN CYCLES IN PLANAR TRIANGULATIONS. In SIAM JOURNAL ON DISCRETE MATHEMATICS. ISSN 0895-4801, 2021, vol. 35, no. 2, pp. 1005-1021., Registrované v: WOS, SCOPUS
[1] ALAHMADI, A. - ALDRED, R. E. L. - THOMASSEN, C. Cycles in 5-connected triangulations. In JOURNAL OF COMBINATORIAL THEORY SERIES B. ISSN 0095-8956, 2020, vol. 140, no., pp. 27-44., Registrované v: WOS, SCOPUS
[1] OZEKI, Kenta - VAN CLEEMPUT, Nico - ZAMFIRESCU, Carol T. Hamiltonian properties of polyhedra with few 3-cuts-A survey. In DISCRETE MATHEMATICS. ISSN 0012-365X, 2018, vol. 341, no. 9, pp. 2646-2660., Registrované v: WOS, SCOPUS
[1] GOERING, Frank - HARANT, Jochen. Prescribed edges and forbidden edges for a cycle in a planar graph. In DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X, 2013, vol. 161, no. 12, pp. 1734-1738., Registrované v: WOS, SCOPUS
[1] GOERING, F. - HARANT, J. Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. In DISCRETE MATHEMATICS. ISSN 0012-365X, 2010, vol. 310, no. 9, pp. 1491-1494., Registrované v: WOS, SCOPUS
[1] GOERING, F. - HARANT, J. Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. In DISCRETE MATHEMATICS. ISSN 0012-365X, 2010, vol. 310, no. 9, pp. 1491-1494., Registrované v: WOS, SCOPUS
[1] YU, QR - LIU, G. Graph Factors and Matching Extensions. In GRAPH FACTORS AND MATCHING EXTENSIONS, 2009, vol., no., pp. 1-353., Registrované v: WOS
[3] PAČAIOVÁ, H. - KORBA, P. - HOVANEC, M. - GALANDA, J. - ŠVÁB, P. - LUKÁČ, J. Use of Simulation Tools for Optimization of the Time Duration of Winter Maintenance Activities at Airports. In Sustainability 2021, 13(3), 1095; https://doi.org/10.3390/su13031095
LIU, Xiaonan - WANG, Zhiyu - YU, Xingxing. Counting Hamiltonian cycles in planar triangulations. In Journal of Combinatorial Theory Series B, 2022-07-01, 155, pp. 256-277. ISSN 00958956. Dostupné na: https://doi.org/10.1016/j.jctb.2022.02.008., Registrované v: SCOPUS
MADER, W. High connectivity keeping sets in n-connected graphs. In Combinatorica, 2004-01-01, 24, 3, pp. 441-458. ISSN 02099683. Dostupné na: https://doi.org/10.1007/s00493-004-0027-6., Registrované v: SCOPUS