• DML-CZ Home

05C45 Eulerian and Hamiltonian graphs (49 articles)

• Tian, Tao; Xiong, Liming; Chen, Zhi-Hong; Wang, Shipeng: Degree sums of adjacent vertices for traceability of claw-free graphs. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 2, pp. 313-330
• Lu, Yong; Zhou, Qiannan: On hyper-Zagreb index conditions for hamiltonicity of graphs. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 3, pp. 653-662
• Dzúrik, Martin: An upper bound of a generalized upper Hamiltonian number of a graph. (English). Archivum Mathematicum, vol. 57 (2021), issue 5, pp. 299-311
• Zheng, Wei; Wang, Ligong: Traceability in $\{K_{1,4},K_{1,4}+e\}$-free graphs. (English). Czechoslovak Mathematical Journal, vol. 69 (2019), issue 2, pp. 431-442
• An, Mingqiang; Xiong, Liming; Tian, Runli: 2-factors in claw-free graphs with locally disconnected vertices. (English). Czechoslovak Mathematical Journal, vol. 65 (2015), issue 2, pp. 317-330
• An, Mingqiang; Lai, Hong-Jian; Li, Hao; Su, Guifu; Tian, Runli; Xiong, Liming: Two operations on a graph preserving the (non)existence of 2-factors in its line graph. (English). Czechoslovak Mathematical Journal, vol. 64 (2014), issue 4, pp. 1035-1044
• Mukwembi, Simon: Minimum degree, leaf number and traceability. (English). Czechoslovak Mathematical Journal, vol. 63 (2013), issue 2, pp. 539-545
• Cavenagh, Nicholas J.: Near-homogeneous spherical Latin bitrades. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 54 (2013), issue 3, pp. 313-328
• Zhao, Kewen: A simple proof of Whitney's Theorem on connectivity in graphs. (English). Mathematica Bohemica, vol. 136 (2011), issue 1, pp. 25-26
• Okamoto, Futaba; Zhang, Ping: On upper traceable numbers of graphs. (English). Mathematica Bohemica, vol. 133 (2008), issue 4, pp. 389-405
• Okamoto, Futaba; Zhang, Ping; Saenpholphat, Varaporn: The upper traceable number of a graph. (English). Czechoslovak Mathematical Journal, vol. 58 (2008), issue 1, pp. 271-287
• Nebeský, Ladislav: The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 317-338
• Saenpholphat, Varaporn; Okamoto, Futaba; Zhang, Ping: Measures of traceability in graphs. (English). Mathematica Bohemica, vol. 131 (2006), issue 1, pp. 63-84
• Janakiraman, T. N.; Muthammai, S.; Bhanumathi, M.: Domination numbers on the Boolean function graph of a graph. (English). Mathematica Bohemica, vol. 130 (2005), issue 2, pp. 135-151
• Janakiraman, T. N.; Muthammai, S.; Bhanumathi, M.: On the Boolean function graph of a graph and on its complement. (English). Mathematica Bohemica, vol. 130 (2005), issue 2, pp. 113-134
• Zelinka, Bohdan: Signed domination numbers of directed graphs. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 2, pp. 479-482
• Nebeský, Ladislav: Hamiltonian colorings of graphs with long cycles. (English). Mathematica Bohemica, vol. 128 (2003), issue 3, pp. 263-275
• Zelinka, Bohdan: Infinite paths in locally finite graphs and in their spanning trees. (English). Mathematica Bohemica, vol. 128 (2003), issue 1, pp. 71-76
• Stacho, Ladislav: A note on two circumference generalizations of Chvátal's Hamiltonicity condition. (English). Mathematica Slovaca, vol. 52 (2002), issue 2, pp. 127-133
• Šišma, Pavel: Vznik a vývoj teorie grafů. (Czech) [The rise and development of graph theory]. Pokroky matematiky, fyziky a astronomie, vol. 43 (1998), issue 2, pp. 89-99
• Owens, Peter John: Self-dual non-Hamiltonian polyhedra with only two types of faces. (English). Mathematica Slovaca, vol. 48 (1998), issue 2, pp. 137-148
• Klavžar, Sandi; Milutinović, Uroš: Graphs $S(n,k)$ and a variant of the Tower of Hanoi problem. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 1, pp. 95-104
• Wisztová, Elena: Hamiltonian connectedness and a matching in powers of connected graphs. (English). Mathematica Bohemica, vol. 120 (1995), issue 3, pp. 305-317
• Polický, Ivan: A sufficient condition for Hamiltonian graphs. (English). Mathematica Slovaca, vol. 45 (1995), issue 2, pp. 115-119
• Knor, Martin: Gray codes in graphs. (English). Mathematica Slovaca, vol. 44 (1994), issue 4, pp. 395-412
• Ivančo, J.; Jendroľ, S.; Tkáč, M.: Note on Petrie and Hamiltonian cycles in cubic polyhedral graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 35 (1994), issue 2, pp. 413-417
• Nebeský, Ladislav: A matching and a Hamiltonian cycle of the fourth power of a connected graph. (English). Mathematica Bohemica, vol. 118 (1993), issue 1, pp. 43-52
• Vacek, Pavel: Bounds of lengths of open Hamiltonian walks. (English). Archivum Mathematicum, vol. 28 (1992), issue 1, pp. 11-16
• Wisztová, Elena: On a Hamiltonian cycle of the fourth power of a connected graph. (English). Mathematica Bohemica, vol. 116 (1991), issue 4, pp. 385-390
• Vacek, Pavel: On open Hamiltonian walks in graphs. (English). Archivum Mathematicum, vol. 27 (1991), issue 1, pp. 105-111
• Jendroľ, Stanislav; Kekeňák, Roman: Longest circuits in triangular and quadrangular $3$-polytopes with two types of edges. (English). Mathematica Slovaca, vol. 40 (1990), issue 4, pp. 341-357
• Fleischner, Herbert; Wenger, Emanuel: $D_0$-favouring Eulerian trails in digraphs. (English). Archivum Mathematicum, vol. 25 (1989), issue 1, pp. 55-60
• Schaar, Günter: Remarks on Hamiltonian properties of squares of graphs. (English). Archivum Mathematicum, vol. 25 (1989), issue 1, pp. 61-72
• Ibaraki, Toshihide; Poljak, Svatopluk: Three-linking in Eulerian digraphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 192
• Říha, Stanislav: Hamiltonian lines in the square of graphs. I. Hamiltonian circuits in the square of cacti. (English). Archivum Mathematicum, vol. 24 (1988), issue 2, pp. 45-56
• Říha, Stanislav: Hamiltonian lines in the square of graphs. II. (English). Archivum Mathematicum, vol. 24 (1988), issue 3, pp. 137-146
• Burzio, Marco; Demaria, Davide Carlo: On a classification of Hamiltonian tournaments. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 29 (1988), issue 2, pp. 3-14
• Witzany, Jiří: On balancing of hypergraphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), issue 1, pp. 15-21
• Kratochvíl, Jan; Zeps, Dainis A.: On Hamiltonian cycles in two-triangle graphs. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 28 (1987), issue 2, pp. 73-78
• Harant, Jochen; Walther, Hansjoachim: Some new results about the shortness exponent in polyhedral graphs. (English). Časopis pro pěstování matematiky, vol. 112 (1987), issue 2, pp. 114-122
• Wisztová, Elena: A Hamiltonian cycle and a $1$-factor in the fourth power of a graph. (English). Časopis pro pěstování matematiky, vol. 110 (1985), issue 4, pp. 403-412
• Nebeský, Ladislav; Wisztová, Elena: Two edge-disjoint Hamiltonian cycles of powers of a graph. (English). Časopis pro pěstování matematiky, vol. 110 (1985), issue 3, pp. 294-301
• Říha, S.; Sekanina, Milan: Squares of triangular cacti. (English). Archivum Mathematicum, vol. 19 (1983), issue 3, pp. 153-160
• Sekanina, Milan; Sekaninová, Anna: Arbitrarily traceable Eulerian graph has the Hamiltonian square. (English). Archivum Mathematicum, vol. 18 (1982), issue 2, pp. 91-93
• Nebeský, Ladislav: On squares of complementary graphs. (English). Mathematica Slovaca, vol. 30 (1980), issue 3, pp. 247-249
• Heinrich, Peter; Schaar, Günter: Zur Charakterisierung von Graphen mit $p$-hamiltonscher $(p+1)$-ter Potenz im Falle $p=3$. (German) [On characterization of graphs with $p$-Hamiltonian $(p+1)$-th power in case $p=3$]. Archivum Mathematicum, vol. 15 (1979), issue 3, pp. 155-170
• Nebeský, Ladislav: On eulerian subgraphs of complementary graphs. (English). Czechoslovak Mathematical Journal, vol. 29 (1979), issue 2, pp. 298-302
• Horák, Peter; Továrek, Leoš: On Hamiltonian cycles of complete $n$-partite graphs. (English). Mathematica Slovaca, vol. 29 (1979), issue 1, pp. 43-47
• Zelinka, Bohdan: Some remarks on Eulerian graphs. (English). Czechoslovak Mathematical Journal, vol. 29 (1979), issue 4, pp. 564-567