• DML-CZ Home

05C35 Extremal problems (170 articles)

• Yan, Jingru: Saturation numbers for linear forests $P_6 + tP_2$. (English). Czechoslovak Mathematical Journal, vol. 73 (2023), issue 4, pp. 1007-1016
• Liu, Xiaoqian; Chen, Xiaodan; Hu, Junli; Zhu, Qiuyun: The extremal irregularity of connected graphs with given number of pendant vertices. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 3, pp. 735-746
• Lin, Jing: Maximum bipartite subgraphs in $H$-free graphs. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 3, pp. 621-635
• Du, Jin-Zhi; Yin, Jian-Hua: The potential-Ramsey number of $K_n$ and $K_t^{-k}$. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 2, pp. 513-522
• Li, Yibo; Liu, Huiqing; Zhang, Ruiting: Quasi-tree graphs with the minimal Sombor indices. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 4, pp. 1227-1238
• Qiao, Pu; Zhan, Xingzhi: The relation between the number of leaves of a tree and its diameter. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 2, pp. 365-369
• Pandey, Dinesh; Patra, Kamal Lochan: Wiener index of graphs with fixed number of pendant or cut-vertices. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 2, pp. 411-431
• Baskoro, Edy Tri; Vetrík, Tomáš: A note on the size Ramsey numbers for matchings versus cycles. (English). Mathematica Bohemica, vol. 146 (2021), issue 2, pp. 229-234
• Sun, Zhi-Hong: Ramsey numbers for trees II. (English). Czechoslovak Mathematical Journal, vol. 71 (2021), issue 2, pp. 351-372
• Chen, Xue-Gang: A note on the double Roman domination number of graphs. (English). Czechoslovak Mathematical Journal, vol. 70 (2020), issue 1, pp. 205-212
• Kaskosz, Barbara; Thoma, Lubos: Lower bounds for integral functionals generated by bipartite graphs. (English). Czechoslovak Mathematical Journal, vol. 69 (2019), issue 2, pp. 571-592
• Zeng, Qinghou; Hou, Jianfeng: Bounds for the number of meeting edges in graph partitioning. (English). Czechoslovak Mathematical Journal, vol. 67 (2017), issue 3, pp. 741-752
• Daugulis, Peteris: A note on another construction of graphs with $4n+6$ vertices and cyclic automorphism group of order $4n$. (English). Archivum Mathematicum, vol. 53 (2017), issue 1, pp. 13-18
• Dorfling, Samantha; Vetrík, Tomáš: Edge-colouring of graphs and hereditary graph properties. (English). Czechoslovak Mathematical Journal, vol. 66 (2016), issue 1, pp. 87-99
• Nikiforov, Vladimir: Spectral radius and Hamiltonicity of graphs with large minimum degree. (English). Czechoslovak Mathematical Journal, vol. 66 (2016), issue 3, pp. 925-940
• 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
• Dzido, Tomasz; Krzywdziński, Krzysztof: Edit distance measure for graphs. (English). Czechoslovak Mathematical Journal, vol. 65 (2015), issue 3, pp. 829-836
• Goldberg, Felix: A spectral bound for graph irregularity. (English). Czechoslovak Mathematical Journal, vol. 65 (2015), issue 2, pp. 375-379
• Azarija, Jernej: Counting graphs with different numbers of spanning trees through the counting of prime partitions. (English). Czechoslovak Mathematical Journal, vol. 64 (2014), issue 1, pp. 31-35
• 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
• Azarija, Jernej; Škrekovski, Riste: Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees. (English). Mathematica Bohemica, vol. 138 (2013), issue 2, pp. 121-131
• Mesežnikov, Dávid: A construction of large graphs of diameter two and given degree from Abelian lifts of dipoles. (English). Kybernetika, vol. 48 (2012), issue 3, pp. 518-521
• Zhang, Guang-Jun; Zhang, Xiao-Dong: The first Dirichlet eigenvalue of bicyclic graphs. (English). Czechoslovak Mathematical Journal, vol. 62 (2012), issue 2, pp. 441-451
• Gomaa, Adel Mahmoud: On four-point boundary value problems for differential inclusions and differential equations with and without multivalued moving constraints. (English). Czechoslovak Mathematical Journal, vol. 62 (2012), issue 1, pp. 139-154
• Li, Shuxian; Zhou, Bo: Ordering the non-starlike trees with large reverse Wiener indices. (English). Czechoslovak Mathematical Journal, vol. 62 (2012), issue 1, pp. 215-233
• Gera, Ralucca; Okamoto, Futaba; Rasmussen, Craig; Zhang, Ping: Set colorings in perfect graphs. (English). Mathematica Bohemica, vol. 136 (2011), issue 1, pp. 61-68
• Volkmann, Lutz: A bound on the $k$-domination number of a graph. (English). Czechoslovak Mathematical Journal, vol. 60 (2010), issue 1, pp. 77-83
• Borowiecki, Mieczysław; Borowiecki, Piotr; Sidorowicz, Elżbieta; Skupień, Zdzisław: On extremal sizes of locally $k$-tree graphs. (English). Czechoslovak Mathematical Journal, vol. 60 (2010), issue 2, pp. 571-587
• Hu, Lili; Lai, Chunhui; Wang, Ping: On potentially $K_5-H$-graphic sequences. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 1, pp. 173-182
• Lai, Chunhui; Hu, Lili: Potentially $K_m-G$-graphical sequences: A survey. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 4, pp. 1059-1075
• Henning, Michael A.; Mynhardt, Christina M.: The diameter of paired-domination vertex critical graphs. (English). Czechoslovak Mathematical Journal, vol. 58 (2008), issue 4, pp. 887-897
• Chen, Xue-Gang: Vertices contained in all minimum paired-dominating sets of a tree. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 1, pp. 407-417
• Chen, Xue-Gang; Sun, Liang: Connected domination critical graphs with respect to relative complements. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 417-423
• Vacek, Ondrej: Diameter-invariant graphs. (English). Mathematica Bohemica, vol. 130 (2005), issue 4, pp. 355-370
• Chen, Xue-Gang; Ma, De-xiang; Xing, Hua-Ming; Sun, Liang: A note on the independent domination number of subset graph. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 2, pp. 511-517
• Xing, Hua-Ming; Sun, Liang; Chen, Xue-Gang: On signed majority total domination in graphs. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 2, pp. 341-348
• Goddard, Wayne; Swart, Christine S.; Swart, Henda C.: On the graphs with maximum distance or $k$-diameter. (English). Mathematica Slovaca, vol. 55 (2005), issue 2, pp. 131-139
• Ma, De-xiang; Chen, Xue-Gang; Sun, Liang: On total restrained domination in graphs. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 1, pp. 165-173
• Zelinka, Bohdan: Remarks on restrained domination and total restrained domination in graphs. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 2, pp. 393-396
• Bálint, V.; Vacek, O.: Radius-invariant graphs. (English). Mathematica Bohemica, vol. 129 (2004), issue 4, pp. 361-377
• 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
• Saenpholphat, Varaporn; Zhang, Ping: Connected resolvability of graphs. (English). Czechoslovak Mathematical Journal, vol. 53 (2003), issue 4, pp. 827-840
• Zelinka, Bohdan: Edge domination in graphs of cubes. (English). Czechoslovak Mathematical Journal, vol. 52 (2002), issue 4, pp. 875-879
• Chartrand, Gary; Zhang, Ping: Extreme geodesic graphs. (English). Czechoslovak Mathematical Journal, vol. 52 (2002), issue 4, pp. 771-780
• Zelinka, Bohdan: Induced-paired domatic numbers of graphs. (English). Mathematica Bohemica, vol. 127 (2002), issue 4, pp. 591-596
• Zelinka, Bohdan: Signed total domination number of a graph. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 2, pp. 225-229
• 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
• Milková, Eva: Moderní pohled na „jistý problém minimální‟. (Czech) [A contemporary view of “certain minimal problem”]. Pokroky matematiky, fyziky a astronomie, vol. 45 (2000), issue 4, pp. 265-273
• Gliviak, Ferdinand: On radially extremal graphs and digraphs, a survey. (English). Mathematica Bohemica, vol. 125 (2000), issue 2, pp. 215-225
• Łuczak, Tomasz: On the maximum automorphism group of self-complementary graphs. (English). Mathematica Slovaca, vol. 50 (2000), issue 1, pp. 17-24
• Simić, Slobodan; Gutman, Ivan; Baltić, Vladimir: Some graphs with extremal Szeged index. (English). Mathematica Slovaca, vol. 50 (2000), issue 1, pp. 1-15
• Jendroľ, Stanislav: Paths with restricted degrees of their vertices in planar graphs. (English). Czechoslovak Mathematical Journal, vol. 49 (1999), issue 3, pp. 481-490
• Zelinka, Bohdan: Point-set domatic numbers of graphs. (English). Mathematica Bohemica, vol. 124 (1999), issue 1, pp. 77-82
• Zelinka, Bohdan: Dominating functions of graphs with two values. (English). Mathematica Bohemica, vol. 123 (1998), issue 3, pp. 263-270
• Zelinka, Bohdan: Location-domatic number of a graph. (English). Mathematica Bohemica, vol. 123 (1998), issue 1, pp. 67-71
• Zelinka, Bohdan: Antidomatic number of a graph. (English). Archivum Mathematicum, vol. 33 (1997), issue 2, pp. 191-195
• Ivančo, Jaroslav: The Hadwiger number of complements of some graphs. (English). Mathematica Slovaca, vol. 47 (1997), issue 4, pp. 393-403
• Chao, Chong-Yun; Han, Shao-cen: On the classification and toughness of generalized permutation star-graphs. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 3, pp. 431-452
• Gliviak, Ferdinand: Two classes of graphs related to extremal eccentricities. (English). Mathematica Bohemica, vol. 122 (1997), issue 3, pp. 231-241
• Brand, Clemens; Seifter, Norbert: Eigenvalues and domination in graphs. (English). Mathematica Slovaca, vol. 46 (1996), issue 1, pp. 33-39
• Zhou, Sanming: On $f$-domination number of a graph. (English). Czechoslovak Mathematical Journal, vol. 46 (1996), issue 3, pp. 489-499
• Hartnell, Bert; Rall, Douglas F.: A characterization of graphs in which some minimum dominating set covers all the edges. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 2, pp. 221-230
• Nebeský, Ladislav: A characterization of the decay number of a connected graph. (English). Mathematica Slovaca, vol. 45 (1995), issue 4, pp. 349-352
• Vestergaard, Preben Dahl; Zelinka, Bohdan: Cut-vertices and domination in graphs. (English). Mathematica Bohemica, vol. 120 (1995), issue 2, pp. 135-143
• Zelinka, Bohdan: Domination in graphs with few edges. (English). Mathematica Bohemica, vol. 120 (1995), issue 4, pp. 405-410
• Zelinka, Bohdan: Edge-domatic numbers of directed graphs. (English). Czechoslovak Mathematical Journal, vol. 45 (1995), issue 3, pp. 449-455
• Jendroľ, Stanislav; Žoldák, Vladimír: The irregularity strength of generalized Petersen graphs. (English). Mathematica Slovaca, vol. 45 (1995), issue 2, pp. 107-113
• Černý, Jan: A note to independent sets in scheduling. (English). Applications of Mathematics, vol. 40 (1995), issue 5, pp. 357-365
• Gliviak, Ferdinand; Knor, Martin: On radially extremal digraphs. (English). Mathematica Bohemica, vol. 120 (1995), issue 1, pp. 41-55
• Regonati, F.; Salvi, N. Zagaglia: Some constructions of $\lambda$-minimal graphs. (English). Czechoslovak Mathematical Journal, vol. 44 (1994), issue 2, pp. 315-323
• Bukor, Jozef: Almost every bipartite graph has not two vertices of minimum degree. (English). Mathematica Slovaca, vol. 43 (1993), issue 2, pp. 113-117
• Nebeský, Ladislav: Characterizing the maximum genus of a connected graph. (English). Czechoslovak Mathematical Journal, vol. 43 (1993), issue 1, pp. 177-185
• Ivančo, Jaroslav; Zelinka, Bohdan: Domination in Kneser graphs. (English). Mathematica Bohemica, vol. 118 (1993), issue 2, pp. 147-152
• Marcu, Dănuţ: Note on Turán's graph. (English). Czechoslovak Mathematical Journal, vol. 43 (1993), issue 3, pp. 499-501
• Zelinka, Bohdan: Edge shift distance between trees. (English). Archivum Mathematicum, vol. 28 (1992), issue 1, pp. 5-9
• Nedela, Roman: Locally-cyclic graphs covering complete tripartite graphs. (English). Mathematica Slovaca, vol. 42 (1992), issue 2, pp. 143-146
• Zelinka, Bohdan: Semidomatic and total semidomatic numbers of directed graphs. (English). Mathematica Bohemica, vol. 117 (1992), issue 1, pp. 1-8
• Zelinka, Bohdan: Distances between rooted trees. (English). Mathematica Bohemica, vol. 116 (1991), issue 1, pp. 101-107
• Zelinka, Bohdan: Edge-domatic numbers of cacti. (English). Mathematica Bohemica, vol. 116 (1991), issue 1, pp. 91-95
• Zverovich, Igor Edmundovich; Zverovich, Vadim E.: A note on domatically critical and cocritical graphs. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 2, pp. 278-281
• Guldan, Filip: Note on linear arboricity of graphs with large girth. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 3, pp. 467-470
• Zelinka, Bohdan: Total edge-domatic number of a graph. (English). Mathematica Bohemica, vol. 116 (1991), issue 1, pp. 96-100
• Zelinka, Bohdan: Domatic numbers of lattice graphs. (English). Czechoslovak Mathematical Journal, vol. 40 (1990), issue 1, pp. 113-115
• Kundrík, Anton: Dual point-partition number of complementary graphs. (English). Mathematica Slovaca, vol. 40 (1990), issue 4, pp. 367-374
• Zelinka, Bohdan: Edge-domatically full graphs. (English). Mathematica Slovaca, vol. 40 (1990), issue 4, pp. 359-365
• Zelinka, Bohdan: The least connected non-vertex-transitive graph with constant neighbourhoods. (English). Czechoslovak Mathematical Journal, vol. 40 (1990), issue 4, pp. 619-624
• Caro, Yair; Tuza, Zsolt: An application of set-pair systems for multitransversals. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 30 (1989), issue 2, pp. 37-39
• Tuza, Zsolt: $C_4$-saturated graphs of minimum size. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 30 (1989), issue 2, pp. 161-167
• Olejník, František: On edge independence numbers and edge covering numbers of $k$-uniform hypergraph. (English). Mathematica Slovaca, vol. 39 (1989), issue 1, pp. 21-26
• 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
• Chartrand, Gary; Oellermann, Ortrud R.; Tian, Song Lin; Zou, Hung Bin: Steiner distance in graphs. (English). Časopis pro pěstování matematiky, vol. 114 (1989), issue 4, pp. 399-410
• Zelinka, Bohdan: The bigraph decomposition number of a graph. (English). Časopis pro pěstování matematiky, vol. 113 (1988), issue 1, pp. 56-59
• 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
• Zelinka, Bohdan: Polytopic locally linear graphs. (English). Mathematica Slovaca, vol. 38 (1988), issue 2, pp. 99-103
• Ivančo, Jaroslav: Some results on the Hadwiger numbers of graphs. (English). Mathematica Slovaca, vol. 38 (1988), issue 3, pp. 221-226
• Zelinka, Bohdan: Edge-distance between isomorphism classes of graphs. (English). Časopis pro pěstování matematiky, vol. 112 (1987), issue 3, pp. 233-237
• Ryjáček, Zdeněk; Zelinka, Bohdan: Locally disconnected graphs with large numbers of edges. (English). Mathematica Slovaca, vol. 37 (1987), issue 2, pp. 195-198
• 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
• 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
• Plesník, Ján: On minimal graphs of diameter $2$ with every edge in a $3$-cycle. (English). Mathematica Slovaca, vol. 36 (1986), issue 2, pp. 145-149
• Vrba, Antonín: The permanent of the Laplacian matrix of a bipartite graph. (English). Czechoslovak Mathematical Journal, vol. 36 (1986), issue 1, pp. 7-17
• Zelinka, Bohdan: Cyclicity of a complete 3-equipartite graph. (English). Archivum Mathematicum, vol. 21 (1985), issue 1, pp. 1-3
• Harary, Frank; Plantholt, Michael: Minimum maximal graphs with forbidden subgraphs. (English). Mathematica Slovaca, vol. 35 (1985), issue 1, pp. 83-89
• Širáň, Jozef: A new lower bound for the inducibility of a graph. (English). Mathematica Slovaca, vol. 34 (1984), issue 4, pp. 365-370
• Zelinka, Bohdan: On $k$-ply domatic numbers of graphs. (English). Mathematica Slovaca, vol. 34 (1984), issue 3, pp. 313-318
• Zelinka, Bohdan: Semidomatic numbers of directed graphs. (English). Mathematica Slovaca, vol. 34 (1984), issue 4, pp. 371-374
• Zelinka, Bohdan: Domatic number and degrees of vertices of a graph. (English). Mathematica Slovaca, vol. 33 (1983), issue 2, pp. 145-147
• Zelinka, Bohdan: Edge-domatic number of a graph. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 1, pp. 107-110
• Bosák, Juraj: Induced subgraphs with the same order and size. (English). Mathematica Slovaca, vol. 33 (1983), issue 1, pp. 105-119
• Poljak, Svatopluk; Rödl, Vojtěch: On classes of graphs determined by forbidden subgraphs. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 1, pp. 27-33
• Li, Qiao; Brualdi, Richard A.: On minimal regular digraphs with girth 4. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 3, pp. 439-447
• Zelinka, Bohdan: Unpath number of a complete multipartite graph. (English). Mathematica Slovaca, vol. 33 (1983), issue 3, pp. 293-296
• Zelinka, Bohdan: Elongation in a graph. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 291-296
• Zelinka, Bohdan: Homomorphisms of finite bipartite graphs onto complete bipartite graphs. (English). Mathematica Slovaca, vol. 32 (1982), issue 4, pp. 361-366
• Tomasta, Pavel: Note on linear arboricity. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 239-242
• Havel, Ivan; Křivánek, Mirko: On maximal matchings in $Q_6$ and a conjecture of R. Forcade. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 1, pp. 123-136
• Híc, Pavol: On partially directed geodetic graphs. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 255-262
• Křivka, Pavel: Dimension of the sum of two copies of a graph. (English). Czechoslovak Mathematical Journal, vol. 31 (1981), issue 4, pp. 514-520
• Zelinka, Bohdan: Intersection number of a graph. (English). Časopis pro pěstování matematiky, vol. 106 (1981), issue 3, pp. 223-225
• Nebeský, Ladislav: A new characterization of the maximum genus of a graph. (English). Czechoslovak Mathematical Journal, vol. 31 (1981), issue 4, pp. 604-613
• Hajnal, A.: On the Ramsey-Turán number of finite graphs. (English). In: Frolík, Zdeněk (ed.): Abstracta. 9th Winter School on Abstract Analysis. Czechoslovak Academy of Sciences, Praha, 1981. pp. 68
• Koubek, Václav; Rajlich, J.: Regular societies without short cycles. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 1, pp. 161-169
• Horák, Peter: Digraphs maximal with respect to connectivity. (English). Mathematica Slovaca, vol. 29 (1979), issue 1, pp. 87-90
• Bosák, Juraj: Directed graphs and matrix equations. (English). Mathematica Slovaca, vol. 28 (1978), issue 2, pp. 189-202
• Rödl, Vojtěch: On systems of graphs intersecting in paths. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 19 (1978), issue 1, pp. 135-140
• Zelinka, Bohdan: Geodetic graphs which are homeomorphic to complete graphs. (English). Mathematica Slovaca, vol. 27 (1977), issue 2, pp. 129-132
• Voss, Heinz-Jürgen: Graphs with prescribed maximal subgraphs and critical chromatic graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 18 (1977), issue 1, pp. 129-142
• Zelinka, Bohdan: A remark on systems of maximal cliques of a graph. (English). Czechoslovak Mathematical Journal, vol. 27 (1977), issue 4, pp. 617-618
• Plesník, Ján: Two constructions of geodetic graphs. (English). Mathematica Slovaca, vol. 27 (1977), issue 1, pp. 65-71
• Tomasta, Pavel: Decompositions of complete $k$-uniform hypergraphs into factors with given diameters. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 17 (1976), issue 2, pp. 377-392
• Mikola, Milan: The extremal connectivity of the strictly weak digraph. (English). Mathematica Slovaca, vol. 26 (1976), issue 2, pp. 115-118
• Nebeský, Ladislav: A generalization of Hamiltonian cycles for trees. (English). Czechoslovak Mathematical Journal, vol. 26 (1976), issue 4, pp. 596-603
• Zelinka, Bohdan: Hadwiger numbers of finite graphs. (English). Mathematica Slovaca, vol. 26 (1976), issue 1, pp. 23-30
• Černý, Ján: Multi-polarized graphs. (English). Aplikace matematiky, vol. 21 (1976), issue 2, pp. 145-147
• Gliviak, Ferdinand: On the existence of critically n-connected graphs. (English). Mathematica Slovaca, vol. 26 (1976), issue 1, pp. 53-56
• Nebeský, Ladislav: On the minimum degree and edge-connectivity of a graph. (English). Časopis pro pěstování matematiky, vol. 101 (1976), issue 2, pp. 199-202
• Nešetřil, Jaroslav; Rödl, Vojtěch: Partitions of vertices. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 17 (1976), issue 1, pp. 85-95
• Sekanina, Milan: Graphs and Betweeness. (English). Matematický časopis, vol. 25 (1975), issue 1, pp. 41-47
• Gliviak, Ferdinand: Maximal Graphs with Given Connectivity and Edge-Connectivity. (English). Matematický časopis, vol. 25 (1975), issue 2, pp. 99-103
• Jacoš, Vasil: On $j$-Pancyclic Graphs. (English). Matematický časopis, vol. 25 (1975), issue 3, pp. 281-286
• Gliviak, Ferdinand: On Certain Edge-Critical Graphs of a Given Diameter. (English). Matematický časopis, vol. 25 (1975), issue 3, pp. 249-263
• Gliviak, Ferdinand: On the impossibility to construct diametrically critical graphs by extensions. (English). Archivum Mathematicum, vol. 11 (1975), issue 3, pp. 131-137
• Nebeský, Ladislav: A theorem on $2$-connected graphs. (English). Časopis pro pěstování matematiky, vol. 100 (1975), issue 2, pp. 116-117
• Zelinka, Bohdan: Zweiseitig unendliche Züge in lokalendlichen Graphen. (German) [Bilateral infinite paths in locally finite graph]. Časopis pro pěstování matematiky, vol. 99 (1974), issue 4, pp. 386-393
• Novák, Jiří: Edge Bases of Complete Uniform Hypergraphs. (English). Matematický časopis, vol. 24 (1974), issue 1, pp. 43-57
• Morávek, Jaroslav: A generalization of a theorem of Turán for valuated graphs. (English). Časopis pro pěstování matematiky, vol. 99 (1974), issue 3, pp. 286-292
• Ninčák, Ján: Hamiltonian circuits in cubic graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 4, pp. 627-630
• Chartrand, Gary; Pippert, Raymond E.: Locally connected graphs. (English). Časopis pro pěstování matematiky, vol. 99 (1974), issue 2, pp. 158-163
• Zelinka, Bohdan: The Number of Non-Isomorphic Hamiltonian Circuits in an $n$-Dimensional Cube. (English). Matematický časopis, vol. 24 (1974), issue 3, pp. 203-208
• Jacoš, V.; Jendroľ, S.: A problem concerning $j$-pancyclic graphs. (English). Matematický časopis, vol. 24 (1974), issue 3, pp. 259-262
• Morávek, Jaroslav: O jednom extremálním problému pro grafy s $\alpha (G)\leq 2$. (Czech) [A certain extremal problem for graphs with $\alpha (G)\leq 2$]. Časopis pro pěstování matematiky, vol. 98 (1973), issue 3, pp. 269-273
• Bosák, Juraj; Fiamčík, Jozef: Chromatic Index of Hamiltonian Graphs. (English). Matematický časopis, vol. 23 (1973), issue 1, pp. 88-94
• Tarwater, J. Dalton; Whitmore, Roy W.: $k$-path Euler graphs. (English). Czechoslovak Mathematical Journal, vol. 23 (1973), issue 3, pp. 413-418
• Ninčák, Ján: On a conjecture by Nash-Williams. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 14 (1973), issue 1, pp. 135-138
• Morávek, Jaroslav: On the degrees of graphs with $\alpha (G) \leq 2$. (English). Časopis pro pěstování matematiky, vol. 98 (1973), issue 4, pp. 400-408
• Nebeský, Ladislav: On the line graph of the square and the square of the line graph of a connected graph. (English). Časopis pro pěstování matematiky, vol. 98 (1973), issue 3, pp. 285-287
• Nebeský, Ladislav: A theorem on Hamiltonian line graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 14 (1973), issue 1, pp. 107-112
• Jucovič, Ernest; Walther, Hans Joachim: Über längste Kreise in flächenregulären Polyedergraphen. (German). Matematický časopis, vol. 23 (1973), issue 2, pp. 164-169
• Plesník, Ján: Connectivity of Regular Graphs and the Existence of 1-Factors. (English). Matematický časopis, vol. 22 (1972), issue 4, pp. 310-318
• Palumbíny, Daniel: On a Certain Type of Decompositions of Complete Graphs into Factors with Equal Diameters. (English). Matematický časopis, vol. 22 (1972), issue 3, pp. 235-242
• Dorninger, Dietmar: Über Eulersche und paare Hamiltonsche Graphen. (German) [On Euler and even Hamilton graphs]. Czechoslovak Mathematical Journal, vol. 22 (1972), issue 4, pp. 600-611
• Bosák, Juraj; Erdös, Pál; Rosa, Alexander: Decompositions of Complete Graphs into Factors with Diameter Two. (English). Matematický časopis, vol. 21 (1971), issue 1, pp. 14-28
• Molnár, Ľudovít: On an evaluation function for heuristic search as a path problem. (English). Kybernetika, vol. 7 (1971), issue 6, pp. (441)-449
• Adámek, Jiří; Koubek, Václav: Remarks on flows in network with short paths. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 12 (1971), issue 4, pp. 661-667
• Koman, Milan: Extremal Crossing Numbers of Complete $k$-Chromatic Graphs. (English). Matematický časopis, vol. 20 (1970), issue 4, pp. 315-325
• Jarník, Vojtěch; Kössler, Miloš O minimálních grafech, obsahujících $n$ daných bodů (Czech) [On minimal graphs containing $n$ given points]. Čas. pro pěst. mat. a fys. 63 (1934), pp. 223--235
• Jarník, Vojtěch; Kössler, Miloš O minimálních grafech, obsahujících $n$ daných bodů (Czech) [On minimal graphs containing $n$ given points]. Čas. Pěst. Mat. Fys. 63 (1934), pp. 223–235
• Jarník, Vojtěch; Kössler, Miloš: O minimálních grafech, obsahujících $n$ daných bodů. (Czech) [On minimal graphs containing $n$ given points]. Časopis pro pěstování matematiky a fysiky, vol. 63 (1934), issue 8, pp. 223-235