• DML-CZ Home

05C38 Paths and cycles (101 articles)

• Deng, Guixin; Yuan, Pingzhi: Isomorphic digraphs from powers modulo $p$. (English). Czechoslovak Mathematical Journal, vol. 61 (2011), issue 3, pp. 771-779
• Zhao, Kewen: A simple proof of Whitney's Theorem on connectivity in graphs. (English). Mathematica Bohemica, vol. 136 (2011), issue 1, pp. 25-26
• Lee, Hung-Chih; Lin, Chiang: Balanced path decomposition of $\lambda K_{n,n}$ and $\lambda K^*_{n,n}$. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 4, pp. 989-997
• Cichacz, Sylwia; Horňák, Mirko: Decomposition of bipartite graphs into closed trails. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 1, pp. 129-144
• Yin, Jian-Hua: Degree sequences of graphs containing a cycle with prescribed length. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 2, pp. 481-487
• Chartrand, Gary; Johns, Garry L.; McKeon, Kathleen A.; Zhang, Ping: Rainbow connection in graphs. (English). Mathematica Bohemica, vol. 133 (2008), issue 1, pp. 85-98
• Billington, Elizabeth J.; Cavenagh, Nicholas J.: Decomposing complete tripartite graphs into closed trails of arbitrary lengths. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 2, pp. 523-551
• Ball, Richard N.; Hager, Anthony W.: Monomorphisms in spaces with Lindelöf filters. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 1, pp. 281-317
• Nebeský, Ladislav: A new approach to chordal graphs. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 1, pp. 465-471
• Bahri, S. M.: Spectral properties of a certain class of Carleman operators. (English). Archivum Mathematicum, vol. 43 (2007), issue 3, pp. 163-175
• Volkmann, Lutz; Winzen, Stefan: Cycles with a given number of vertices from each partite set in regular multipartite tournaments. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 827-843
• 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
• Bossong, Ulrike; Schweigert, Dietmar: Minimal paths on ordered graphs. (English). Mathematica Slovaca, vol. 56 (2006), issue 1, pp. 23-31
• Nebeský, Ladislav: Signpost systems and spanning trees of graphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 885-893
• Nebeský, Ladislav: Travel groupoids. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 659-675
• Nebeský, Ladislav: On signpost systems and connected graphs. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 2, pp. 283-293
• Alsardary, Salar Y.; Ali, Ali A.: The basis number of some special non-planar graphs. (English). Czechoslovak Mathematical Journal, vol. 53 (2003), issue 2, pp. 225-240
• 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
• Zelinka, Bohdan: The 3-path-step operator on trees and unicyclic graphs. (English). Mathematica Bohemica, vol. 127 (2002), issue 1, pp. 33-40
• Zelinka, Bohdan: Domination in generalized Petersen graphs. (English). Czechoslovak Mathematical Journal, vol. 52 (2002), issue 1, pp. 11-16
• Knor, Martin; Niepel, Ľudovít: Graphs isomorphic to their path graphs. (English). Mathematica Bohemica, vol. 127 (2002), issue 3, pp. 473-480
• Nebeský, Ladislav: The induced paths in a connected graph and a ternary relation determined by them. (English). Mathematica Bohemica, vol. 127 (2002), issue 3, pp. 397-408
• 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
• Polat, Norbert: End-faithful spanning trees of countable graphs with prescribed sets of rays. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 1, pp. 45-53
• Chartrand, Gary; Jarrett, Elzbieta B.; Saba, Farrokh; Salehi, Ebrahim; Zhang, Ping: $F$-continuous graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 2, pp. 351-361
• Changat, Manoj; Mulder, Henry Martyn: Route systems on graphs. (English). Mathematica Bohemica, vol. 126 (2001), issue 3, pp. 607-612
• Alsardary, Salar Y.: An upper bound on the basis number of the powers of the complete graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 2, pp. 231-238
• Smolíková, Petra: Homomorphism duality for rooted oriented paths. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 41 (2000), issue 3, pp. 631-643
• Jendroľ, S.; Voss, H. J.: Light paths with an odd number of vertices in polyhedral maps. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 3, pp. 555-564
• Nebeský, Ladislav: A theorem for an axiomatic approach to metric properties of graphs. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 1, pp. 121-133
• Klobučar, Antoaneta: Domination numbers of cardinal products. (English). Mathematica Slovaca, vol. 49 (1999), issue 4, pp. 387-402
• Jendroľ, Stanislav: Paths with restricted degrees of their vertices in planar graphs. (English). Czechoslovak Mathematical Journal, vol. 49 (1999), issue 3, pp. 481-490
• Nebeský, Ladislav: An algebraic characterization of geodetic graphs. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 4, pp. 701-710
• Fu, Hung-Lin; Škoviera, Martin; Tsai, Ming-Chun: The maximum genus, matchings and the cycle space of a graph. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 2, pp. 329-339
• Nebeský, Ladislav: A new proof of a characterization of the set of all geodesics in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 4, pp. 809-813
• 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
• Zelinka, Bohdan: Circular distance in directed graphs. (English). Mathematica Bohemica, vol. 122 (1997), issue 2, pp. 113-119
• Nebeský, Ladislav: Geodesics and steps in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 1, pp. 149-161
• 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
• Marcu, Dănuţ: Note on a Lovász's result. (English). Mathematica Bohemica, vol. 122 (1997), issue 4, pp. 401-403
• Bakonyi, Mihály; Bono, Aaron: Several results on chordal bipartite graphs. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 4, pp. 577-583
• Nebeský, Ladislav: On the set of all shortest paths of a given length in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 46 (1996), issue 1, pp. 155-160
• Nebeský, Ladislav: A characterization of geodetic graphs. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 491-493
• Chartrand, Gary; Harary, Frank; Hossain, Moazzem; Schultz, Kelly: Exact $2$-step domination in graphs. (English). Mathematica Bohemica, vol. 120 (1995), issue 2, pp. 125-134
• Zelinka, Bohdan: Median properties of graphs with small diameters. (English). Mathematica Bohemica, vol. 120 (1995), issue 3, pp. 319-323
• Tkáč, Michal: On longest circuits in certain non-regular planar graphs. (English). Mathematica Slovaca, vol. 45 (1995), issue 3, pp. 235-242
• Nebeský, Ladislav: Visibilities and sets of shortest paths in a connected graph. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 563-570
• Nebeský, Ladislav: A characterization of the set of all shortest paths in a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 1, pp. 15-20
• 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: Route systems of a connected graph. (English). Mathematica Bohemica, vol. 119 (1994), issue 4, pp. 407-414
• 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
• Zelinka, Bohdan: A modification of the median of a tree. (English). Mathematica Bohemica, vol. 118 (1993), issue 2, pp. 195-200
• Youssef, Samy A.; Hulsurkar, S. G.: More on the girth of graphs on Weyl groups. (English). Archivum Mathematicum, vol. 29 (1993), issue 1, pp. 19-23
• Vacek, Pavel: Bounds of lengths of open Hamiltonian walks. (English). Archivum Mathematicum, vol. 28 (1992), issue 1, pp. 11-16
• Tkáč, Michal: Simple 3-polytopal graphs with edges of only two types and shortness coefficients. (English). Mathematica Slovaca, vol. 42 (1992), issue 2, pp. 147-152
• 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
• Changat, Manoj: On order and geodesic alignment of a connected bigraph. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 4, pp. 713-715
• Klešč, Marián: On the crossing numbers of Cartesian products of stars and paths or cycles. (English). Mathematica Slovaca, vol. 41 (1991), issue 2, pp. 113-120
• Nebeský, Ladislav: Route systems and bipartite graphs. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 2, pp. 260-264
• Fronček, Dalibor: Graphs with a given edge neighbourhood. (English). Czechoslovak Mathematical Journal, vol. 39 (1989), issue 4, pp. 627-630
• Fronček, Dalibor: Locally path-like graphs. (English). Časopis pro pěstování matematiky, vol. 114 (1989), issue 2, pp. 176-180
• Trenkler, Marián: On $4$-connected, planar $4$-almost pancyclic graphs. (English). Mathematica Slovaca, vol. 39 (1989), issue 1, pp. 13-20
• Plesník, Ján; Znám, Štefan: On equality of edge-connectivity and minimum degree of a graph. (English). Archivum Mathematicum, vol. 25 (1989), issue 1, pp. 19-25
• Puš, Vladimír: Representation of semigroups by products of simple graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 2, pp. 227-234
• Ibaraki, Toshihide; Poljak, Svatopluk: Three-linking in Eulerian digraphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 192
• Nieminen, Juhani: Boolean graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 2, pp. 387-392
• Matoušek, Jiří: Few colored cuts or cycles in edge colored graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 2, pp. 227-232
• Zelinka, Bohdan: Locally snake-like graphs. (English). Mathematica Slovaca, vol. 38 (1988), issue 1, pp. 85-88
• Poljak, Svatopluk: Maximum rank of a power of a matrix of a given pattern. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 1, pp. 195
• Tomasta, Pavel; Tomová, Eliška: On $H$-closed graphs. (English). Czechoslovak Mathematical Journal, vol. 38 (1988), issue 3, pp. 404-419
• Bulitko, V. K.; Ninčák, Jan: Групповые раскраски полных двудольных графов и оценки чисел Хегквиста. (Russian) [Group colorings of complete bipartite graphs and bounds for Häggkvist numbers]. Mathematica Slovaca, vol. 38 (1988), issue 1, pp. 11-17
• Majcher, Zofia: Alternating cycles and realizations of a degree sequence. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), issue 3, pp. 467-480
• Jirásek, Jozef: On a certain class of multidigraphs, for which reversal of no arc decreases the number of their cycles. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), issue 1, pp. 185-189
• Zelinka, Bohdan: On a problem of P. Vestergaard concerning circuits in graphs. (English). Czechoslovak Mathematical Journal, vol. 37 (1987), issue 2, pp. 318-319
• Plesník, Ján: On the interchange heuristic for locating centers and medians in a graph. (English). Mathematica Slovaca, vol. 37 (1987), issue 2, pp. 209-216
• Puš, Vladimír: A remark on distances in products of graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), issue 2, pp. 233-239
• Lee, Sin Min; Tanoto, Rudy: Three classes of diameter edge-invariant graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), issue 2, pp. 227-232
• Híc, Pavol: Criticality concepts in geodetic graphs. (English). Mathematica Slovaca, vol. 36 (1986), issue 3, pp. 329-333
• Šoltés, Ľubomír: Orientations of graphs minimizing the radius or the diameter. (English). Mathematica Slovaca, vol. 36 (1986), issue 3, pp. 289-296
• Chartrand, Gary; Oellermann, Ortrud R.; Ruiz, Sergio: Randomly $H$ graphs. (English). Mathematica Slovaca, vol. 36 (1986), issue 2, pp. 129-136
• Truszczyński, Mirosław: Centers and centroids of unicyclic graphs. (English). Mathematica Slovaca, vol. 35 (1985), issue 3, pp. 223-228
• Híc, Pavol: A construction of geodetic blocks. (English). Mathematica Slovaca, vol. 35 (1985), issue 3, pp. 251-261
• Zelinka, Bohdan: Cyclicity of a complete 3-equipartite graph. (English). Archivum Mathematicum, vol. 21 (1985), issue 1, pp. 1-3
• Horák, Peter: A note on removing a point of a strong digraph. (English). Mathematica Slovaca, vol. 33 (1983), issue 1, pp. 85-86
• Zelinka, Bohdan: On $k$-domatic numbers of graphs. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 2, pp. 309-313
• Zelinka, Bohdan: Elongation in a graph. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 291-296
• Poljak, Svatopluk; Turzík, Daniel; Pudlák, Pavel: Extensions of $k$-subsets to $k+1$-subsets - existence versus constructability. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 2, pp. 337-349
• Híc, Pavol: On partially directed geodetic graphs. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 255-262
• Andersen, Lars Døvling; Grant, Douglas D.: Homopolar circuits in polar graphs. (English). Czechoslovak Mathematical Journal, vol. 31 (1981), issue 2, pp. 218-228
• Poljak, Svatopluk; Turzík, Daniel: A note on dimension of $P^n_3$. (English). Czechoslovak Mathematical Journal, vol. 31 (1981), issue 3, pp. 484-487
• Niepel, Ľudovít: On decompositions of complete graphs into factors with given diameters and radii. (English). Mathematica Slovaca, vol. 30 (1980), issue 1, pp. 3-11
• Wisztová, Elena: Paths in powers of graph. (English). Časopis pro pěstování matematiky, vol. 105 (1980), issue 3, pp. 292-301
• Koubek, Václav; Rajlich, J.: Regular societies without short cycles. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 1, pp. 161-169
• Nieminen, Juhani: On prime and principal ideals on graphs. (English). Archivum Mathematicum, vol. 15 (1979), issue 3, pp. 151-154
• Nešetřil, Jaroslav; Rödl, Vojtěch: On Ramsey graphs without cycles of short odd lengths. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 20 (1979), issue 3, pp. 565-582
• Bosák, Juraj: Partially directed Moore graphs. (English). Mathematica Slovaca, vol. 29 (1979), issue 2, pp. 181-196
• Šimáně, Čestmír: De Bruijn cycles and their application for encoding of discrete positions. (English). Kybernetika, vol. 14 (1978), issue 6, pp. (408)-420
• Nieminen, Juhani: Operations on graphs determining congruences on graphs. (English). Archivum Mathematicum, vol. 14 (1978), issue 4, pp. 215-218
• Harary, Frank; Manvel, Bennet: On the number of cycles in a graph. (English). Matematický časopis, vol. 21 (1971), issue 1, pp. 55-63