Professor Bohdan Zelinka (May 16, 1940--February 5, 2005)

 Access to full text

 Full (PDF)

1. Le nombre de connexité maximum d’un graphe aux nombre de sommets et d’arètes donnés, Cas. Pest. Mat. 88 (1963), 391–395. (1963) Zbl0127.39205MR0181589
2. Some inequalities concerning $\Pi$-isomorphisms, Cas. Pest. Mat. 90 (1965), 474–476. (1965) Zbl0131.01203MR0190007
3. The diameter of the graph of the system of proper semigroups of a commutative semigroup, Mat.-Fyz. Cas. SAV 15 (1965), 143–144. (Czech) (1965) 
4. Decomposition of a graph into isomorphic subgraphs, Cas. Pest. Mat. 90 (1965), 147–150. (Czech) (1965) Zbl0139.41403MR0193031
5. The graph of the system of chords of a given circle, Mat.-Fyz. Cas. SAV 15 (1965), 273–279. (Czech) (1965) Zbl0142.41601MR0194365
6. Un langage adéquat non homogène, dont les classes sont disjointes deux à deux, Rev. Roum. Math. Pure Appl. 10 (1965), 1255–1257. (1965) Zbl0143.01502MR0199063
7. A remark on $\Pi$-automorphisms, Cas. Pest. Mat. 90 (1965), 99–100. (1965) MR0204299
8. Opérations avec les modèles analytiques de langages, Bull. Math. Soc. Sci. Math. Répub. Soc. Roum., Nouv. Sér. 9 (1965), 351–355. (1965) Zbl0156.01604MR0219366
9. Introducing an orientation into a given non-directed graph, Mat.-Fyz. Cas. SAV 16 (1966), 66–71. (1966) Zbl0138.19501MR0204325
10. Sur le PS-isomorphisme des langues, Z. Math. Logik Grundlagen Math. 12 (1966), 263–265. (1966) Zbl0143.01501MR0224444
11. The semigroup of non-void subsets of a cyclic semigroup, Cas. Pest. Mat. 91 (1966), 72–76. (Czech) (1966) Zbl0143.03401MR0197612
12. Beweis der Unabhängigkeit des Birkhoffschen Postulatsystems für distributive Verbände mit Einheitselement, Cas. Pest. Mat. 91 (1966), 472–477. (Czech) (1966) Zbl0161.01401
13. On the number of independent complete subgraphs, Publ. Math. 13 (1966), 95–97. (1966) Zbl0173.26301MR0205881
14. Zu einem Problem von S. M. Ulam, Cas. Pest. Mat. 92 (1967), 219–220. (Czech) (1967) Zbl0155.35001
15. Un langage hereditaire qui n’est pas à un nombre d’états fini, Rev. Roum. Math. Pures Appl. 12 (1967), 1107–1108. (1967) Zbl0158.00902MR0223193
16. Decomposition of the complete graph according to a given group, Mat. Cas. SAV 17 (1967), 234–239. (Czech) (1967) Zbl0162.27802MR0221978
17. A remark on infinite edge-disjoint systems of paths in a graph, Cas. Pest. Mat. 92 (1967), 289–292. (1967) Zbl0164.24901MR0224503
18. Sur les langages absolument bien adéquat, Rev. Roum. Math. Pures Appl. 12 (1967), 737–739. (1967) MR0223192
19. Hasse’s operator and directed graphs, Cas. Pest. Mat. 92 (1967), 313–317. (1967) MR0223274
20. A contribution to my article ‘Introducing an orientation into a given nondirected graph’, 17 (1967), Erratum, 316. (1967) Zbl0196.56201
21. Tolerance graphs, Commentat. Math. Univ. Carol. 9 (1968), 121–131. (1968) Zbl0155.51206MR0232698
22. On a type of multiplicative lattices, Mat. Cas. SAV 18 (1968), 90–98. (1968) Zbl0157.03903MR0244124
23. Uncountable systems of edge-disjoint paths in a graph, Cas. Pest. Mat. 93 (1968), 251–254. (1968) Zbl0164.24902MR0269539
24. Sur les langages absolument non adéquats, Rev. Roum. Math. Pures Appl. 13 (1968), 131–133. (1968) Zbl0164.32101MR0228298
25. The decomposition of a generalized graph into isomorphic subgraphs, Cas. Pest. Mat. 93 (1968), 278–283. (1968) Zbl0167.22301MR0274329
26. On some problems of the Symposium in Smolenice, Theory of graphs. Proc. Colloq. Tihany, Hungary 1966, 1968, pp. 347–360. Zbl0201.56704
27. Medians and peripherians of trees, Arch. Math., Brno 4 (1968), 87–95. (1968) Zbl0206.26105MR0269541
28. Les graphes de Hasse des modèles analytique de langages, Bull. Math. Soc. Sci. Math. Répub. Soc. Roum., Nouv. Sér. 13 (1969), 389–392. (1969) MR0281559
29. Uneigentliche Knotenpunkte eines Graphen, Cas. Pest. Mat. 95 (1970), 155–169. (Czech) (1970) Zbl0192.60803
30. Decomposition of simplex-like graphs and generalized bipartite graphs, Cas. Pest. Mat. 95 (1970), 1–5. (Czech) (1970) MR0266805
31. Centrally symmetric Hasse diagrams of finite modular lattices, Czech. Math. J. 20 (1970), 81–83. (1970) Zbl0194.32601MR0255441
32. Sur le PS-isomorphisme fort des langages, Bull. Math. Soc. Sci. Math. Répub. Soc. Roum., Nouv. Sér. 13 (1970), 123–126. (1970) MR0263576
33. Weitere Bemerkungen über unendliche kantenfremde Wegsysteme auf einem Graph, Cas. Pest. Mat. 95 (1970), 309–315. (Czech) (1970) Zbl0196.27302
34. Schwach homogene Graphen, Cas. Pest. Mat. 95 (1970), 248–251. (Czech) (1970) Zbl0196.27303
35. Tolerance in algebraic structures, Czech. Math. J. 20 (1970), 179–183. (1970) Zbl0197.01002MR0260653
36. Decomposition of a digraph into isomorphic subgraphs, 20 (1970), 92–100. (1970) Zbl0197.50504MR0306036
37. On $(H,K)$-decompositions of a complete graph, Mat. Cas. SAV 20 (1970), 116–121. (1970) Zbl0197.50601MR0306056
38. Le groupe des S-automorphismes d’un langage, Rev. Roum. Math. Pures Appl. 15 (1970), 453–458. (1970) Zbl0198.03003MR0263577
39. Regular graphs, each edge of which belongs to exactly one s-gon, Mat. Cas. SAV 29 (1970), 181–184 (with A. Kotzig). (1970) Zbl0204.24304MR0309804
40. The decomposition of a general graph according to a given Abelian group, Mat. Cas. SAV 20 (1970), 281–292. (1970) Zbl0206.26203MR0306039
41. Generalized gravity centres of trees, Sb. Ped. Fak. Univ. Karlovy, Matematika, 1970, pp. 127–136. (Czech) (1970) 
42. The graphs, all of whose spanning trees are isomorphic to each other, Cas. Pest. Mat. 96 (1971), 33–40. (Czech) (1971) Zbl0204.57102MR0286711
43. Some remarks on Menger’s theorem, Cas. Pest. Mat. 96 (1971), 145–150. (1971) Zbl0211.57203MR0285442
44. Alternating connectivity of digraphs, Cas. Pest. Mat. 96 (1971), 151–163. (1971) Zbl0211.57204MR0285453
45. Homogeneous digraphs, Czech. Math. J. 21 (1971), 280–290. (1971) Zbl0218.05060MR0323612
46. Alternating connectivity of tournaments, Cas. Pest. Mat. 96 (1971), 346–352. (1971) Zbl0223.05109MR0373953
47. The decomposition of a digraph into isotopic subgraphs, 21 (1971), 221–226. (1971) Zbl0223.05110MR0304230
48. The group of autopies of a digraph, Czech. Math. J. 21 (1971), 619–624. (1971) MR0323618
49. Groups and homogeneous graphs, Czech. Math. J. 21 (1971), 653–660. (1971) Zbl0223.05112MR0289364
50. Deux problèmes sur les grammaires à un nombre d’états fini, Rev. Roum. Math. Pures Appl. 16 (1971), 999–1002. (1971) Zbl0242.68036MR0287998
51. On some problems of the lattice theory, Acta Fac. Rer. Natur. Univ. Comenian. Math. (1971), 87–98. (1971) Zbl0244.06006MR0376466
52. Isotopy of digraphs, Czech. Math. J. 22 (1972), 353–360. (1972) Zbl0239.05118MR0306037
53. Reconstructing a graph from the incidence relation on its edge set, Mat. Cas. SAV 22 (1972), 164–171. (1972) Zbl0239.05136MR0319802
54. Embedding infinite trees into a cube of infinite dimension, Cas. Pest. Mat. 97 (1972), 386–388. (1972) Zbl0243.05102MR0360325
55. Direct limits of finitary relation spaces, J. Math. Tokushima Univ. 6 (1972), 31–35. (1972) Zbl0252.02057MR0319854
56. Corrections to my papers “Some remarks on Menger’s theorem” and “Alternating connectivity of digraphs”, Cas. Pest. Mat. 98 (1973), 98. (1973) Zbl0248.05126
57. Meromorphisms of graphs, Czech. Math. J. 23 (1973), 50–56. (1973) Zbl0256.05113
58. On some graph-theoretical problems of V. G. Vizing, Cas. Pest. Mat. 98 (1973), 56–66. (1973) Zbl0256.05116MR0319814
59. A remark on a graph-covering conjecture of D. R. Woodall, J. Lond. Math. Soc. II, Ser. 6 (1973), 637–638. (1973) Zbl0257.05108MR0379301
60. Edge-colourings of permutation graphs, Mat. Cas. SAV 23 (1973), 193–198. (1973) Zbl0262.05109MR0332550
61. Line isomorphisms on dipseudographs, J. Comb. Theory, Ser. B 14 (1973), 105–121 (with R. L. Hemminger). (1973) Zbl0263.05107MR0314679
62. Finding a spanning tree with maximal number of terminal vertices, Kybernetika, Praha 9 (1973), 357–360. (1973) MR0323598
63. Determining the maximal degree of a tree given by its distance matrix, Kybernetika, Praha 9 (1973), 361–364. (1973) Zbl0265.05102MR0323599
64. Intersection graphs of lattices, Mat. Cas. SAV 23 (1973), 216–222. (1973) Zbl0267.06002MR0327599
65. Quasigroups and factorization of complete digraphs, 23 (1973), 333–341. (1973) MR0360349
66. Polare und polarisierte Graphen, 18. Internat. Wiss. Kolloqu., Ilmenau 2, 1973, pp. 27–28. (1973) Zbl0272.05102
67. Une remarque sur l’heredité par domination dans les modèles mathématiques de languages, Rev. Roum. Math. Pures Appl. 18 (1973), 1321–1323. (1973) MR0334606
68. Polar graphs and railway traffic, Apl. Mat. 19 (1974), 169–174. (1974) Zbl0283.05116MR0347346
69. The number of non-isomorphic Hamiltonian circuits in an n-dimensional cube, Mat. Cas. SAV 24 (1974), 203–208. (1974) Zbl0287.94019MR0351898
70. Zweiseitig unendliche Züge in lokalendlichen Graphen, Cas. Pest. Mat. 99 1, 386–393. Zbl0295.05112
71. Tolerance relation on lattices, Cas. Pest. Mat. 99 (1974), 394–399 (with I. Chajda). (1974) Zbl0297.06001MR0360380
72. Cayley color graphs of groups and their generalisations, Acta Fac. Rer. Nat. Univ. Comenian., Math. (1975), 59–64. (1975) Zbl0293.05133MR0347666
73. On Hadwiger number of a graph, Cas. Pest. Mat. 100 (1975), 155–159. (1975) Zbl0301.05127MR0396348
74. Finite vertex-transitive planar graphs of the regularity degree four or five, Mat. Cas. SAV 25 (1975), 271–280. (1975) Zbl0306.05107MR0505792
75. Involutory pairs of vertices in transitive graphs, 25 (1975), 221–222. (1975) Zbl0306.05108MR0412016
76. Intersection graphs of graphs, Mat. Cas. SAV 25 (1975), 129–133. (1975) Zbl0309.05128MR0432498
77. Intersection graphs of finite Abelian groups, 25 (1975), 171–174. (1975) Zbl0311.05119MR0372075
78. Geodetic graphs of diameter two, 25 (1975), 148–153. (1975) Zbl0311.05127MR0369184
79. On a certain distance between isomorphism classes of graphs, Cas. Pest. Mat. 100 (1975), 371–375. (1975) Zbl0312.05121MR0416995
80. Compatible relations on algebras, Cas. Pest. Mat. 100 (1975), 355–360 (with I. Chajda). (1975) Zbl0315.08004MR0389710
81. Tolerance in algebraic structures. II, Czech. Math. J. 25 (1975), 175–178. (1975) Zbl0316.08001MR0457323
82. Two-way infinite trails in locally finite graphs, Recent Adv. Graph Theory, Proc. Symp., Praha 1974, 1975, pp. 533–535. Zbl0322.05134MR0412027
83. Tolerance relations on semilattices, Commentat. Math. Univ. Carol. 16 (1975), 333–338. (1975) Zbl0326.06004MR0369199
84. Intersection graphs of semilattices, Mat. Cas. SAV 25 (1975), 345–350. (1975) Zbl0326.06005MR0427185
85. Tolerances and congruences on tree algebras, 25 (1975), 634–637. (1975) Zbl0327.08002MR0387099
86. Interrelations between the theory of graphs and abstract algebra, Knižnice, Odb. Věd. Spisů Vys. Uč. Tech. Brno, B-56, 1975, pp. 109–114. (Czech) Zbl0329.05124
87. A remark on dot-compositions of graphs, J. Indian Math. Soc., N. Ser. 38 (1974, 1975), 221–225. (1974, 1975) MR0419303
88. $(0,1)$-matrices with isomorphic term bigraphs have equal ranks, J. Indian Math. Soc., N. Ser. 39 (1975), 315–319. (1975) Zbl0419.05037MR0498287
89. Groups and polar graphs, Cas. Pest. Mat. 101 (1976), 2–6. (1976) Zbl0319.05118MR0505793
90. Hadwiger numbers of finite graphs, 26 (1976), 23–30. (1976) Zbl0324.05120MR0427145
91. The Hadwiger number of an infinite graph, Math. Slovaca 26 (1976), 153–157. (1976) Zbl0326.05105MR0427146
92. Embedding trees into block graphs, Czech. Math. J. 26 (1976), 273–279. (1976) Zbl0328.05101MR0447028
93. Weakly associative lattices and tolerance relations, 26 (1976), 259–269 (with I. Chajda). (1976) Zbl0332.06002MR0401558
94. On existence conditions for compatible tolerances (with I. Chajda, J. Niederle), 26 (1976), 304–311. (1976) MR0401561
95. Isomorphisms of polar and polarized graphs, 26 (1976), 339–351. (1976) Zbl0341.05121MR0498288
96. Analoga of Menger’s theorem for polar and polarized graphs, Czech. Math. J. 26 (1976), 352–360. (1976) Zbl0341.05122MR0498289
97. Eulerian polar graphs, 26 (1976), 361–364. (1976) Zbl0341.05123MR0505895
98. Self-derived polar graphs, 26 (1976), 365–370. (1976) Zbl0341.05124MR0498290
99. Short survey lecture on infinite graphs, Graphs, Hypergraphs, Block Systems. Proc. Symp. Comb. Anal., Zielona Góra 1976, 1976, pp. 333–339. 
100. Intersection graphs of trees and tree algebras, 26 (1976), 343–350. (1976) Zbl0367.05028MR0434857
101. Finite planar vertex-transitive graphs of the regularity degree three, Cas. Pest. Mat. 102 (1977), 1–9. (1977) Zbl0341.05114MR0498238
102. On a problem of R. Halin concerning subgraphs of infinite graphs, Math. Slovaca 27 (1977), 43–47. (1977) Zbl0348.05112MR0465953
103. Lattices of tolerances, Cas. Pest. Mat. 102 (1977), 10–24 (with I. Chajda). (1977) Zbl0354.08011MR0450152
104. Permutable tolerances, Cas. Pest. Mat. 102 (1977), 217–220 (with I. Chajda). (1977) Zbl0356.08003MR0457301
105. The lattice of all subtrees of a tree, Math. Slovaca 27 (1977), 277–286. (1977) Zbl0357.05035MR0536145
106. A remark on isotopies of digraphs and permutation matrices, Cas. Pest. Mat. 102 (1977), 230–233. (1977) Zbl0359.05025MR0472590
107. Tolerance relations on periodic commutative semigroups, 27 (1977), 167–169. (1977) Zbl0359.20045MR0427509
108. Geodetic graphs which are homeomorphic to complete graphs, Math. Slovaca 27 (1977), 129–132. (1977) Zbl0362.05070MR0463039
109. Caterpillars, Cas. Pest. Mat. 102 (1977), 179–185. (1977) Zbl0367.05029MR0480125
110. Minimal compatible tolerances on lattices, Czech. Math. J. 27 (1977), 452–459. (1977) Zbl0379.06002MR0457300
111. A remark on systems of maximal cliques of a graph, 27 (1977), 617–618. (1977) Zbl0378.05039MR0469823
112. Infinite directed paths in locally finite digraphs, Cas. Pest. Mat. 103 (1978), 136–140. (1978) Zbl0388.05020MR0480163
113. On a problem of R. Häggkvist concerning edge-colouring of graphs, Cas. Pest. Mat. 103 (1978), 289–290. (1978) MR0506558
114. Dot-compositions of graphs, Combinatorics, Keszthely 1976, Colloq. Aath. Soc. Janos. Bolyai 18, 1978, pp. 1169–1176. Zbl0391.05043MR0519333
115. The number of isomorphism classes of spanning trees of a graph, Math. Slovaca 28 (1978), 385–388. (1978) Zbl0403.05031MR0534817
116. Metrics and tolerances, Arch. Math., Brno 14 (1978), 193–200 (with I. Chajda). (1978) Zbl0414.06006MR0512761
117. A remark on the Čebyšev property, 28 (1978), 311–316. (1978) Zbl0428.15003MR0534999
118. Derivatives of hypergraphs, 28 (1978), 394–399. (1978) Zbl0444.05059MR0501206
119. Self-complementary vertex-transitive undirected graphs, 29 (1979), 91–95. (1979) Zbl0398.05062MR0561783
120. Embedding trees into clique-bridge-clique graphs, Cas. Pest. Mat. 104 (1979), 353–356. (1979) Zbl0403.05032MR0553169
121. Strongly connected digraphs in which each edge is contained in exactly two cycles, Acta Cybern. 4 (1979), 203–205. (1979) Zbl0406.05041MR0525045
122. Some remarks on Eulerian graphs, Czech. Math. J. 29 (1979), 564–567. (1979) Zbl0407.05061MR0548218
123. Tolerances and convexity, 29 (1979), 584–587 (with I. Chajda). (1979) Zbl0407.06002MR0548221
124. Tolerance relations on direct products of monoids and distributive lattices, Glas. Mat., III. Ser. 14 (1979), 11–16 (with I. Chajda). (1979) Zbl0408.08001MR0544056
125. Join graph of trees, Czech. Math. J. 30 (1980), 332–335. (1980) 
126. Subarborians, Czech. Math. J. 30 (1980), 336–340. (1980) Zbl0419.05019MR0566057
127. Domatically critical graphs, Czech. Math. J. 30 (1980), 486–489. (1980) Zbl0426.05046MR0583627
128. Bases of classes of trees closed under subdivisions, 30 (1980), 61–64. (1980) Zbl0427.05026MR0568215
129. How to draw tolerance lattices of finite chains, Arch. Math., Brno 16 (1980), 161–165 (with I. Chajda, J. Dalík, J. Niederle, V. Veselý). (1980) Zbl0449.06006MR0594461
130. The bichromaticity of a graph, Czech. Math. J. 30 (1980), 655–660. (1980) Zbl0477.05041MR0592329
131. Decomposition of a complete equipartite graph into isomorphic subgraphs, Math. Slovaca 31 (1981), 165–169 (with P. Tomasta). (1981) Zbl0459.05055MR0611628
132. Finite spherical geometries, Cas. Pest. Mat. 106 (1981), 206–208. (1981) Zbl0471.51012MR0621184
133. Intersection number of a graph, Cas. Pest. Mat. 106 (1981), 223–225. (1981) Zbl0471.05039MR0629720
134. On domatic numbers of graphs, 31 (1981), 91–95. (1981) Zbl0476.05063MR0619511
135. Some remarks on domatic numbers of graphs, Cas. Pest. Mat. 106 (1981), 373–375. (1981) Zbl0476.05063MR0637816
136. Graphs of semigroups, Cas. Pest. Mat., 407–408. MR0637820
137. On two graph-theoretical problems from the conference at Nová Ves u Branžeže, Cas. Pest. Mat. 106 (1981), 409–413. (1981) Zbl0473.05052MR0637821
138. Graph representations of finite Abelian groups, 31 (1981), 83–86. (1981) Zbl0476.05042MR0604114
139. Cyclically simple tournaments, Publ. Math. 28 (1981), 99–102. (1981) Zbl0478.05044MR0625629
140. On double covers of graphs, 32 (1982), 49–54. (1982) Zbl0483.05057MR0648219
141. Infinite tree algebras, Cas. Pest. Mat. 107 (1982), 59–68. (1982) Zbl0487.05022MR0651082
142. Domatic numbers of cube graphs, Math. Slovaca 32 (1982), 117–119. (1982) Zbl0487.05057MR0658244
143. On two problems of the graph theory, Cas. Pest. Mat. 107 (1982), 109–113. (1982) Zbl0492.05058MR0659739
144. Elongation in a graph, Math. Slovaca 32 (1982), 291–296. (1982) Zbl0494.05034MR0670005
145. Homomorphisms of finite bipartite graphs onto complete bipartite graphs, 32 (1982), 361–366. (1982) Zbl0504.05056MR0676572
146. Logics of bipartite graphs and complete multipartite graphs, Cas. Pest. Mat. 107 (1982), 425–427 (with Z. Andres). (1982) Zbl0505.05055MR0683825
147. Bichromaticity and minimum degree of a bipartite graph, Glas. Mat., III. Ser. 17 (1982), 237–239. (1982) Zbl0506.05039MR0692496
148. Domatische Zahlen der Graphen, Rostocker Math. Kolloq. 21 (1982), 69–72. (1982) Zbl0517.05054MR0713636
149. Adomatic and idomatic numbers of graphs, Math. Slovaca 33 (1983), 99–103. (1983) Zbl0507.05059MR0689285
150. Isonemality and mononemality of woven fabrics, Apl. Mat. 28 (1983), 194–198. (1983) Zbl0515.05027MR0701738
151. A distance between isomorphism classes of trees, 33 (1983), 126–130. (1983) Zbl0523.05028MR0687425
152. Nearly acyclic digraphs, Czech. Math. J. 33 (1983), 164–165. (1983) Zbl0515.05034MR0687429
153. Domatic number and degrees of vertices of a graph, 33 (1983), 145–147. (1983) Zbl0516.05032MR0699083
154. Domatically cocritical graphs, Cas. Pest. Mat. 108 (1983), 82–88. (1983) Zbl0517.05055MR0694143
155. Pure circuits in cube graphs, Cas. Pest. Mat. 108 (1983), 239–240. (1983) Zbl0518.05055MR0716407
156. Unpath number of a complete multiplicative graph, 33 (1983), 293–296. (1983) MR0713951
157. Locally tree-like graphs, Cas. Pest. Mat. 108 (1983), 230–238. (1983) Zbl0528.05040MR0716406
158. Domatic number and bichromaticity of a graph, Graph theory, Proc. Conf., Lagów, Poland, 1981. Lect. Notes Math. vol. 1018, 1983, pp. 278–285. (1983) Zbl0532.05054MR0730659
159. Edge-domatic number of a graph, Czech. Math. J. 33 (1983), 107–110. (1983) Zbl0537.05049MR0687422
160. On k-domatic numbers of graphs, Czech. Math. J. 33 (1983), 309–313. (1983) Zbl0537.05050MR0699028
161. Double covers and logics of graphs, 33 (1983), 354–360. (1983) Zbl0537.05070MR0718920
162. Double covers and logics of graphs. II, Math. Slovaca 33 (1983), 329–334. (1983) Zbl0524.05058MR0720501
163. Directly decomposable tolerances on direct products of lattices and semilattices, Czech. Math. J. 33 (1983), 519–521 (with I. Chajda). (1983) Zbl0538.06008MR0721081
164. Homomorphisms of infinite bipartite graphs onto complete bipartite graphs, Czech. Math. J. 33, 545–547. Zbl0543.05058MR0721085
165. Tolerances and orderings on semilattices, Arch. Math., Brno 19 (1983), 125–131 (with J. Nieminen, I. Chajda). (1983) Zbl0554.06006MR0725194
166. Complemented tolerances on lattices, Cas. Pest. Mat. 109 (1984), 54–59 (with I. Chajda). (1984) Zbl0536.06007MR0741208
167. On a problem of A. Kotzig concerning factorizations of 4-regular graphs, J. Graph Theory 8 (1984), 325–330. (1984) Zbl0537.05047MR0742884
168. Decomposition of an infinite complete graph into complete bipartite subgraphs, Cas. Pest. Mat. 109 (1984), 266–267. (1984) Zbl0545.05058MR0755591
169. Tolerances on monounary algebras, Czech. Math. J. 34 (1984), 298–304. (1984) Zbl0546.08001MR0743493
170. Symmetries of woven fabrics, Apl. Mat. 29 (1984), 14–22. (1984) Zbl0574.05012MR0729949
171. On $k$-ply domatic numbers of graphs, Math. Slovaca 34 (1984), 313–318. (1984) Zbl0602.05039MR0756989
172. Semidomatic numbers of directed graphs, Math. Slovaca 34 (1984), 371–374. (1984) Zbl0602.05038MR0775244
173. Cyclicity of a complete 3-equipartite graph, Arch. Math., Brno 21 (1985), 1–3. (1985) Zbl0574.05028MR0818301
174. Bichromaticity and domatic number of a bipartite graph, Cas. Pest. Mat. 110 (1985), 113–115. (1985) Zbl0575.05046MR0796560
175. Graphs with prescribed neighbourhood graphs, Math. Slovaca 35 (1985), 195–197. (1985) Zbl0579.05045MR0795015
176. Comparison of various distances between isomorphism classes of graphs, Cas. Pest. Mat. 110 (1985), 289–293. (1985) Zbl0579.05056MR0808079
177. Domatic numbers of uniform hypergraphs, Arch. Math., Brno 21 (1985), 129–133. (1985) Zbl0605.05032MR0833123
178. Odd graphs, Arch. Math., Brno 21 (1985), 181–187. (1985) Zbl0591.05062MR0833129
179. Every finite chain is the tolerance lattice of some lattice, Glas. Mat., III. Ser. 20 (1985), 3–6. (1985) Zbl0587.06001MR0818608
180. Domatic number and linear arboricity of cacti, Math. Slovaca 36 (1986), 49–54. (1986) Zbl0583.05050MR0832370
181. Neighbourhood tournaments, Math. Slovaca 36 (1986), 241–244. (1986) Zbl0599.05027MR0866624
182. Edge neighbourhood graphs, Czech. Math. J. 36 (1986), 44–47. (1986) Zbl0599.05054MR0822865
183. Disconnected neighbourhood graphs, Math. Slovaca 36 (1986), 109–110. (1986) Zbl0603.05039MR0849700
184. Connected domatic number of a graph, Math. Slovaca 36 (1986), 387–392. (1986) Zbl0625.05042MR0871778
185. Tolerances on graph algebras, Czech. Math. J. 37 (1987), 313–317. (1987) Zbl0623.05022MR0882602
186. A characterization of tolerance-distributive tree semilattices, Czech. Math. J. 37 (1987), 175–180 (with I. Chajda). (1987) Zbl0625.06002MR0882591
187. Neighbourhood digraphs, Arch. Math., Brno 23 (1987), 69–70. (1987) Zbl0626.05018MR0930322
188. The distance between a graph and its complement, 37 (1987), 120–123. (1987) Zbl0632.05046MR0875132
189. Edge-distance between isomorphism classes of graphs, Cas. Pest. Mat. 112 (1987), 233–237. (1987) Zbl0646.05035MR0905968
190. Distances between directed graphs, Cas. Pest. Mat. 112 (1987), 359–367. (1987) Zbl0643.05033MR0921325
191. Locally disconnected graphs with large numbers of edges, 37 (1987), 195–198 (with Z. Ryjáček). (1987) Zbl0673.05060MR0899435
192. Natural bijections between directed and undirected self-complementary graphs, Math. Slovaca 37 (1987), 363–366. (1987) Zbl0659.05051MR0916944
193. On a problem of P. Vestergaard concerning circuits in graphs, Czech. Math. J. 37 (1987), 318–319. (1987) Zbl0676.05064MR0882603
194. Block-closed subgraphs and $q$-partitions of graphs, Zastosow. Mat. 19 (1987), 629–634. (1987) Zbl0721.05041MR0951378
195. Locally snake-like graphs, Math. Slovaca 88 (1988), 85–88. (1988) Zbl0641.05031MR0945083
196. The distance between various orientations of a graph, 38 (1988), 19–25. (1988) Zbl0644.05024MR0945076
197. Complementarily domatic number of a graph, Math. Slovaca 38 (1988), 27–32. (1988) Zbl0641.05045MR0945077
198. Polytopic locally linear graphs, Math. Slovaca 38 (1988), 99–103. (1988) Zbl0642.05029MR0945363
199. Total domatic number of cacti, Math. Slovaca 38 (1988), 207–214. (1988) Zbl0654.05059MR0977897
200. Two local properties of graphs, Cas. Pest. Mat. 113 (1988), 113–121. (1988) Zbl0656.05056MR0949039
201. Small directed graphs as neighbourhood graphs, 38 (1988), 269–273. (1988) Zbl0657.05031MR0946295
202. The graph of labellings of a given graph, Math. Slovaca 38 (1988), 297–300. (1988) Zbl0665.05041MR0978758
203. Tolerances of polyunary algebras, Arch. Math., Brno 24 (1988), 1–4. (1988) Zbl0666.08002MR0983002
204. Tolerances and congruences on implication algebras, Czech. Math. J. 38 (1988), 207–217 (with I. Chajda). (1988) Zbl0678.08003MR0946288
205. A remark on signed posets and signed graphs, Czech. Math. J. 38 (1988), 673–676. (1988) Zbl0679.05067MR0962910
206. Partitionability of trees, 38 (1988), 677–681. (1988) Zbl0672.05021MR0962911
207. The bigraph decomposition number of a graph, Cas. Pest. Mat. 113 (1988), 56–59. (1988) Zbl0698.05043MR0930806
208. A remark on cancellation in direct products of graphs, Cas. Pest. Mat. 114 (1989), 35–38. (1989) Zbl0663.05053MR0990114
209. Spanning trees of locally finite graphs, Czech. Math. J. 39 (1989), 193–197. (1989) Zbl0679.05023MR0992126
210. Centers of directed cacti, Cas. Pest. Mat. 114 (1989), 225–229. (1989) Zbl0681.05034MR1016631
211. Total domatic number and degrees of vertices of a graph, Math. Slovaca 39 (1989), 7–11. (1989) Zbl0688.05066MR1016324
212. Neighbourhood realizations of complements of intersection graphs, Math. Slovaca 39 (1989), 361–363. (1989) Zbl0757.05098MR1094758
213. Contraction distance between isomorphism classes of graphs, Cas. Pest. Mat. 115 (1990), 211–216. (1990) Zbl0731.05016MR1054008
214. Domatic numbers of lattice graphs, Czech. Math. J. 40 (1990), 113–115. (1990) Zbl0735.05043MR1032364
215. The least connected non-transitive graph with constant neighbourhoods, Czech. Math. J. 40 (1990), 619–624. (1990) MR1084898
216. Regular totally domatically full graphs, Discrete Math. 86 (1990), 71–79. (1990) Zbl0745.05065MR1088561
217. Domination in cubic graphs, Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 1990, pp. 727–735. (1990) Zbl0745.05064MR1100097
218. Edge-domatically full graphs, Math. Slovaca 40 (1990), 359–365. (1990) Zbl0757.05090MR1120966
219. A remark on self-centroidal graphs, Zastosow. Mat. 21 (1991), 109–112. (1991) Zbl0742.05073MR1109911
220. Edge-domatic numbers of cacti, Math. Bohem. 116 (1991), 91–95. (1991) Zbl0743.05032MR1100426
221. Total edge-domatic number of a graph, Math. Bohem. 116 (1991), 96–100. (1991) Zbl0743.05033MR1100427
222. Distances between rooted trees, Math. Bohem. 116 (1991), 101–107. (1991) Zbl0743.05019MR1100428
223. Domination in cubes, Math. Slovaca 41 (1991), 17–19. (1991) Zbl0753.05056MR1094979
224. Every connected acyclic digraph of height 1 is neighbourhood-realizable, Arch. Math., Brno 27a (1991), 133–135. (1991) Zbl0758.05056MR1189650
225. Semidomatic and total semidomatic numbers of directed graphs, Math. Bohem. 117 (1992), 1–8. (1992) Zbl0754.05041MR1154049
226. Distances between graphs. Combinatorics, graphs and complexity. Proc. 4th Czechosl. Symp., Prachatice, 1990, Ann. Discrete Math. 51 (1992), 355–361. (1992) 
227. Domatic number of a graph and its variants, Combinatorics, graphs and complexity. Proc. 4th Czechosl. Symp., Prachatice, 1990. Ann. Discrete Math. 51 (1992), 363–369. (1992) Zbl0772.05058
228. Tolerances on poset algebras, Math. Bohem. 117 (1992), 93–97. (1992) Zbl0765.06004MR1154058
229. Equivalences between isomorphism classes in infinite graphs, Math. Bohem. 117 (1992), 151–155. (1992) MR1165891
230. Edge shift distance between trees, Arch. Math., Brno 28 (1992), 5–9. (1992) Zbl0788.05027MR1201860
231. Domination in Kneser graphs, 118 (1993), 147–152 (with J. Ivančo). (1993) Zbl0778.05043MR1223479
232. Graphs in which each pair of vertices has exactly two common neighbours, Math. Bohem. 118 (1993), 163–165. (1993) Zbl0777.05092MR1223481
233. Distances between partially ordered sets, Math. Bohem. 118 (1993), 167–170. (1993) Zbl0787.06004MR1223482
234. A modification of the median of a tree, Math. Bohem. 118 (1993), 195–200. (1993) Zbl0778.05030MR1223485
235. Representation of undirected graphs by anticommutative conservative groupoids, 119 (1994), 231–237. (1994) Zbl0828.20074MR1305526
236. Extended trees of graphs, Math. Bohem. 119 (1994), 239–244. (1994) Zbl0814.05027MR1305527
237. Tolerances and congruences on conservative groupoids, General Algebra and Ordered Sets. Proc. Int. Conf. and Summer School, Horní Lipová, Czech Rep., 1994, Chajda, I. et al. (eds.), Palacký Univ., Olomouc, pp. 168–171. Zbl0828.20073
238. Cut-vertices and domination in graphs, Math. Bohem. 120 (1995), 135–143 (with P. D. Vestergaard). (1995) Zbl0839.05052MR1357598
239. Domination in graphs with few edges, Math. Bohem. 120 (1995), 405–410. (1995) Zbl0844.05058MR1415088
240. Edge-domatic numbers of directed graphs, Czech. Math. J. 45 (1995), 449–455. (1995) Zbl0847.05063MR1344510
241. Median properties of graphs with small diameters, 120 (1995), 319–323. (1995) Zbl0847.05052MR1369690
242. Subtraction semigroups, Math. Bohem. 120 (1995), 445–447. (1995) Zbl0851.20057MR1415091
243. Some remarks on domination in cubic graphs, Discrete Math. 158 (1996), 249–255. (1996) Zbl0861.05034MR1411121
244. Atomary tolerances on finite algebras, Math. Bohem. 121 (1996), 35–39. (1996) Zbl0863.08003MR1388172
245. The graph theory hymn, Discuss. Math., Graph Theory 16 (1996), 219–221 (with Z. Ryjáček, M. Meszka, J. Nowakz). (Czech, Polish) (1996) Zbl0877.05060
246. Antidomatic number of a graph, Arch. Math., Brno 33 (1996), 191–195. (1996) Zbl0909.05031MR1478772
247. Minimal signed dominating functions of graphs, Proc. of the Prague Math. Conf., 1996, in honor of the 70th birthdays of I. Babuška, M. Fiedler, J. Kurzweil, V. Pták. Icaris Ltd., pp. 359–363. Zbl0959.05081
248. Poison from Erdős, Geombinatorics 6 (1997), 117–118. (1997) MR1439077
249. Circular distance in directed graphs, Math. Bohem. 122 (1997), 113–117. (1997) Zbl0889.05045MR1460940
250. On two transformations of graphs, Math. Bohem. 122 (1997), 357–363. (1997) Zbl0898.05022MR1489396
251. Domatic numbers of graphs and their variants: A survey, Domination in Graphs. Advanced topics, Haynes, T. W. et al. (eds.), New York, NY, Marcel Dekker. Pure Appl. Math. vol. 209, 1998, pp. 351–377. (1998) Zbl0894.05026MR1605698
252. Location-domatic number of a graph, Math. Bohem. 123 (1998), 67–71. (1998) Zbl0898.05034MR1618719
253. On the simplex graph operator, Discuss. Math., Graph Theory 18 (1998), 165–169. (1998) Zbl0930.05084MR1687831
254. Domination in products of circuits, Acta Univ. M. Belii, Ser. Math. 6 (1998), 57–62. (1998) Zbl0933.05116MR1683016
255. Dominating functions of graphs with two values, 123 (1998), 263–270. (1998) Zbl0933.05111MR1645438
256. Graphs maximal with respect to absence of Hamiltonian paths, Discuss. Math., Graph Theory 18 (1998), 205–208. (1998) Zbl0935.05062MR1687847
257. Domination in graphs, V. Bálint (ed.), Proc. Int. Sc. Conf. Math., Žilina, Slovakia, 1998, vol. 2, EDIS, Žilina Univ. Publisher, 1999, pp. 151–154. (1999) Zbl1114.05303
258. Point set domatic numbers of graphs, Math. Bohem. 124 (1999), 77–82. (1999) Zbl0933.05112MR1687413
259. A remark on graph operators, Math. Bohem. 124 (1999), 83–85. (1999) Zbl0933.05148MR1687488
260. Locally regular graphs, 125 (2000), 481–484. (2000) Zbl0963.05119MR1802296
261. A note on periodicity of the 2-distance operator, Discuss. Math., Graph Theory 20 (2000), 267–269. (2000) Zbl0979.05038MR1817497
262. On a problem concerning stratified graphs, Czech. Math. J. 50 (2000), 47–49. (2000) Zbl1033.05035MR1745457
263. Signed total domination number of a graph, Czech. Math. J. 51 (2001), 225–229. (2001) Zbl0977.05096MR1844306
264. Periodicity of graph operators, Discrete Math. 235 (2001), 349–351. (2001) Zbl0984.05072MR1829865
265. On 2-periodic graphs of a certain graph operator, Discuss. Math., Graph Theory 21 (2001), 13–30 (with I. Havel). (2001) Zbl0990.05107MR1867484
266. Tolerances and congruences on tree groupoids, I. Chajda et al. (eds.), Contributions to General Algebra 13. Proc. 60th workshop on general algebra, 60. Arbeitstagung Allgemeine Algebra, Dresden, 2000, and of the summer school ’99 on general algebra and ordered sets, Velké Karlovice, Czech Rep., 1999. Klagenfurt: Verlag Johannes Heyn, 2001, pp. 361–363. Zbl0991.08003MR1854563
267. The 3-path-step operator on trees and unicyclic graphs, 127 (2002), 33–40. (2002) Zbl0995.05076MR1895244
268. On signed edge domination numbers of trees, Math. Bohem. 127 (2002), 49–55. (2002) Zbl0995.05112MR1895246
269. Domination in generalized Petersen graphs, Czech. Math. J. 52 (2002), 11–16. (2002) Zbl0995.05107MR1885452
270. On a problem of E. Prisner concerning the biclique operator, Math. Bohem. 127 (2002), 371–373. (2002) Zbl1003.05048MR1931321
271. Induced-paired domatic numbers of graphs, 127 (2002), 591–596. (2002) Zbl1003.05078MR1942644
272. Edge-dominations in graphs of cubes, Czech. Math. J. 52 (2002), 875–879. (2002) MR1940066
273. Algebraic approach to locally finite trees with one end, 128 (2003), 37–44. (2003) Zbl1010.05019MR1973423
274. Infinite paths in locally finite graphs and in their spanning trees, Math. Bohem. 128 (2003), 71–76. (2003) Zbl1010.05039MR1974546
275. Domination in bipartite graphs and in their complements, 53 (2003), 241–247. (2003) Zbl1021.05074MR1983448
276. On a problem concerning $k$-subdomination numbers of graphs, Czech. Math. J. 53 (2003), 627–629. (2003) Zbl1080.05526MR2000058
277. A remark on branch weights in countable trees, 129 (2004), 29–31. (2004) Zbl1050.05028MR2048784
278. Signed 2-domination in caterpillers, Math. Bohem. 129 (2004), 393–398. (2004) MR2102612
279. Signed domatic number of a graph, Discrete Appl. Math. 150 (2005), 261–267 (with L. Volkmann). (2005) Zbl1079.05071MR2161350
280. Remarks on restrained domination and total restrained domination in graphs, Czech. Math. J. 555 (2005), 393–396. (2005) Zbl1081.05050MR2137145
281. Signed domination numbers of directed graphs, Czech. Math. J. 55 (2005), 479–482. (2005) Zbl1081.05042MR2137154
282. Signed and minus domination in bipartite graphs, Czech. Math. J. 56 (2006), 587–590. (2006) Zbl1164.05428MR2291758