[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. MR 0181589 | Zbl 0127.39205

[2] Some inequalities concerning $\Pi $-isomorphisms. Cas. Pest. Mat. 90 (1965), 474–476. MR 0190007 | Zbl 0131.01203

[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)

[4] Decomposition of a graph into isomorphic subgraphs. Cas. Pest. Mat. 90 (1965), 147–150. (Czech) MR 0193031 | Zbl 0139.41403

[5] The graph of the system of chords of a given circle. Mat.-Fyz. Cas. SAV 15 (1965), 273–279. (Czech) MR 0194365 | Zbl 0142.41601

[6] Un langage adéquat non homogène, dont les classes sont disjointes deux à deux. Rev. Roum. Math. Pure Appl. 10 (1965), 1255–1257. MR 0199063 | Zbl 0143.01502

[7] A remark on $\Pi $-automorphisms. Cas. Pest. Mat. 90 (1965), 99–100. MR 0204299

[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. MR 0219366 | Zbl 0156.01604

[9] Introducing an orientation into a given non-directed graph. Mat.-Fyz. Cas. SAV 16 (1966), 66–71. MR 0204325 | Zbl 0138.19501

[10] Sur le PS-isomorphisme des langues. Z. Math. Logik Grundlagen Math. 12 (1966), 263–265. MR 0224444 | Zbl 0143.01501

[11] The semigroup of non-void subsets of a cyclic semigroup. Cas. Pest. Mat. 91 (1966), 72–76. (Czech) MR 0197612 | Zbl 0143.03401

[12] Beweis der Unabhängigkeit des Birkhoffschen Postulatsystems für distributive Verbände mit Einheitselement. Cas. Pest. Mat. 91 (1966), 472–477. (Czech) Zbl 0161.01401

[13] On the number of independent complete subgraphs. Publ. Math. 13 (1966), 95–97. MR 0205881 | Zbl 0173.26301

[14] Zu einem Problem von S. M. Ulam. Cas. Pest. Mat. 92 (1967), 219–220. (Czech) Zbl 0155.35001

[15] Un langage hereditaire qui n’est pas à un nombre d’états fini. Rev. Roum. Math. Pures Appl. 12 (1967), 1107–1108. MR 0223193 | Zbl 0158.00902

[16] Decomposition of the complete graph according to a given group. Mat. Cas. SAV 17 (1967), 234–239. (Czech) MR 0221978 | Zbl 0162.27802

[17] A remark on infinite edge-disjoint systems of paths in a graph. Cas. Pest. Mat. 92 (1967), 289–292. MR 0224503 | Zbl 0164.24901

[18] Sur les langages absolument bien adéquat. Rev. Roum. Math. Pures Appl. 12 (1967), 737–739. MR 0223192

[19] Hasse’s operator and directed graphs. Cas. Pest. Mat. 92 (1967), 313–317. MR 0223274

[20] A contribution to my article ‘Introducing an orientation into a given nondirected graph’. 17 (1967), Erratum, 316. Zbl 0196.56201

[21] Tolerance graphs. Commentat. Math. Univ. Carol. 9 (1968), 121–131. MR 0232698 | Zbl 0155.51206

[22] On a type of multiplicative lattices. Mat. Cas. SAV 18 (1968), 90–98. MR 0244124 | Zbl 0157.03903

[23] Uncountable systems of edge-disjoint paths in a graph. Cas. Pest. Mat. 93 (1968), 251–254. MR 0269539 | Zbl 0164.24902

[24] Sur les langages absolument non adéquats. Rev. Roum. Math. Pures Appl. 13 (1968), 131–133. MR 0228298 | Zbl 0164.32101

[25] The decomposition of a generalized graph into isomorphic subgraphs. Cas. Pest. Mat. 93 (1968), 278–283. MR 0274329 | Zbl 0167.22301

[26] On some problems of the Symposium in Smolenice. Theory of graphs. Proc. Colloq. Tihany, Hungary 1966, 1968, pp. 347–360. Zbl 0201.56704

[27] Medians and peripherians of trees. Arch. Math., Brno 4 (1968), 87–95. MR 0269541 | Zbl 0206.26105

[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. MR 0281559

[29] Uneigentliche Knotenpunkte eines Graphen. Cas. Pest. Mat. 95 (1970), 155–169. (Czech) Zbl 0192.60803

[30] Decomposition of simplex-like graphs and generalized bipartite graphs. Cas. Pest. Mat. 95 (1970), 1–5. (Czech) MR 0266805

[31] Centrally symmetric Hasse diagrams of finite modular lattices. Czech. Math. J. 20 (1970), 81–83. MR 0255441 | Zbl 0194.32601

[32] Sur le PS-isomorphisme fort des langages. Bull. Math. Soc. Sci. Math. Répub. Soc. Roum., Nouv. Sér. 13 (1970), 123–126. MR 0263576

[33] Weitere Bemerkungen über unendliche kantenfremde Wegsysteme auf einem Graph. Cas. Pest. Mat. 95 (1970), 309–315. (Czech) Zbl 0196.27302

[34] Schwach homogene Graphen. Cas. Pest. Mat. 95 (1970), 248–251. (Czech) Zbl 0196.27303

[35] Tolerance in algebraic structures. Czech. Math. J. 20 (1970), 179–183. MR 0260653 | Zbl 0197.01002

[36] Decomposition of a digraph into isomorphic subgraphs. 20 (1970), 92–100. MR 0306036 | Zbl 0197.50504

[37] On $(H,K)$-decompositions of a complete graph. Mat. Cas. SAV 20 (1970), 116–121. MR 0306056 | Zbl 0197.50601

[38] Le groupe des S-automorphismes d’un langage. Rev. Roum. Math. Pures Appl. 15 (1970), 453–458. MR 0263577 | Zbl 0198.03003

[39] Regular graphs, each edge of which belongs to exactly one s-gon. Mat. Cas. SAV 29 (1970), 181–184 (with A. Kotzig). MR 0309804 | Zbl 0204.24304

[40] The decomposition of a general graph according to a given Abelian group. Mat. Cas. SAV 20 (1970), 281–292. MR 0306039 | Zbl 0206.26203

[41] Generalized gravity centres of trees. Sb. Ped. Fak. Univ. Karlovy, Matematika, 1970, pp. 127–136. (Czech)

[42] The graphs, all of whose spanning trees are isomorphic to each other. Cas. Pest. Mat. 96 (1971), 33–40. (Czech) MR 0286711 | Zbl 0204.57102

[43] Some remarks on Menger’s theorem. Cas. Pest. Mat. 96 (1971), 145–150. MR 0285442 | Zbl 0211.57203

[44] Alternating connectivity of digraphs. Cas. Pest. Mat. 96 (1971), 151–163. MR 0285453 | Zbl 0211.57204

[45] Homogeneous digraphs. Czech. Math. J. 21 (1971), 280–290. MR 0323612 | Zbl 0218.05060

[46] Alternating connectivity of tournaments. Cas. Pest. Mat. 96 (1971), 346–352. MR 0373953 | Zbl 0223.05109

[47] The decomposition of a digraph into isotopic subgraphs. 21 (1971), 221–226. MR 0304230 | Zbl 0223.05110

[48] The group of autopies of a digraph. Czech. Math. J. 21 (1971), 619–624. MR 0323618

[49] Groups and homogeneous graphs. Czech. Math. J. 21 (1971), 653–660. MR 0289364 | Zbl 0223.05112

[50] Deux problèmes sur les grammaires à un nombre d’états fini. Rev. Roum. Math. Pures Appl. 16 (1971), 999–1002. MR 0287998 | Zbl 0242.68036

[51] On some problems of the lattice theory. Acta Fac. Rer. Natur. Univ. Comenian. Math. (1971), 87–98. MR 0376466 | Zbl 0244.06006

[52] Isotopy of digraphs. Czech. Math. J. 22 (1972), 353–360. MR 0306037 | Zbl 0239.05118

[53] Reconstructing a graph from the incidence relation on its edge set. Mat. Cas. SAV 22 (1972), 164–171. MR 0319802 | Zbl 0239.05136

[54] Embedding infinite trees into a cube of infinite dimension. Cas. Pest. Mat. 97 (1972), 386–388. MR 0360325 | Zbl 0243.05102

[55] Direct limits of finitary relation spaces. J. Math. Tokushima Univ. 6 (1972), 31–35. MR 0319854 | Zbl 0252.02057

[56] Corrections to my papers “Some remarks on Menger’s theorem” and “Alternating connectivity of digraphs”. Cas. Pest. Mat. 98 (1973), 98. Zbl 0248.05126

[57] Meromorphisms of graphs. Czech. Math. J. 23 (1973), 50–56. Zbl 0256.05113

[58] On some graph-theoretical problems of V. G. Vizing. Cas. Pest. Mat. 98 (1973), 56–66. MR 0319814 | Zbl 0256.05116

[59] A remark on a graph-covering conjecture of D. R. Woodall. J. Lond. Math. Soc. II, Ser. 6 (1973), 637–638. MR 0379301 | Zbl 0257.05108

[60] Edge-colourings of permutation graphs. Mat. Cas. SAV 23 (1973), 193–198. MR 0332550 | Zbl 0262.05109

[61] Line isomorphisms on dipseudographs. J. Comb. Theory, Ser. B 14 (1973), 105–121 (with R. L. Hemminger). MR 0314679 | Zbl 0263.05107

[62] Finding a spanning tree with maximal number of terminal vertices. Kybernetika, Praha 9 (1973), 357–360. MR 0323598

[63] Determining the maximal degree of a tree given by its distance matrix. Kybernetika, Praha 9 (1973), 361–364. MR 0323599 | Zbl 0265.05102

[64] Intersection graphs of lattices. Mat. Cas. SAV 23 (1973), 216–222. MR 0327599 | Zbl 0267.06002

[65] Quasigroups and factorization of complete digraphs. 23 (1973), 333–341. MR 0360349

[66] Polare und polarisierte Graphen. 18. Internat. Wiss. Kolloqu., Ilmenau 2, 1973, pp. 27–28. Zbl 0272.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. MR 0334606

[68] Polar graphs and railway traffic. Apl. Mat. 19 (1974), 169–174. MR 0347346 | Zbl 0283.05116

[69] The number of non-isomorphic Hamiltonian circuits in an n-dimensional cube. Mat. Cas. SAV 24 (1974), 203–208. MR 0351898 | Zbl 0287.94019

[70] Zweiseitig unendliche Züge in lokalendlichen Graphen. Cas. Pest. Mat. 99 1, 386–393. Zbl 0295.05112

[71] Tolerance relation on lattices. Cas. Pest. Mat. 99 (1974), 394–399 (with I. Chajda). MR 0360380 | Zbl 0297.06001

[72] Cayley color graphs of groups and their generalisations. Acta Fac. Rer. Nat. Univ. Comenian., Math. (1975), 59–64. MR 0347666 | Zbl 0293.05133

[73] On Hadwiger number of a graph. Cas. Pest. Mat. 100 (1975), 155–159. MR 0396348 | Zbl 0301.05127

[74] Finite vertex-transitive planar graphs of the regularity degree four or five. Mat. Cas. SAV 25 (1975), 271–280. MR 0505792 | Zbl 0306.05107

[75] Involutory pairs of vertices in transitive graphs. 25 (1975), 221–222. MR 0412016 | Zbl 0306.05108

[76] Intersection graphs of graphs. Mat. Cas. SAV 25 (1975), 129–133. MR 0432498 | Zbl 0309.05128

[77] Intersection graphs of finite Abelian groups. 25 (1975), 171–174. MR 0372075 | Zbl 0311.05119

[78] Geodetic graphs of diameter two. 25 (1975), 148–153. MR 0369184 | Zbl 0311.05127

[79] On a certain distance between isomorphism classes of graphs. Cas. Pest. Mat. 100 (1975), 371–375. MR 0416995 | Zbl 0312.05121

[80] Compatible relations on algebras. Cas. Pest. Mat. 100 (1975), 355–360 (with I. Chajda). MR 0389710 | Zbl 0315.08004

[81] Tolerance in algebraic structures. II. Czech. Math. J. 25 (1975), 175–178. MR 0457323 | Zbl 0316.08001

[82] Two-way infinite trails in locally finite graphs. Recent Adv. Graph Theory, Proc. Symp., Praha 1974, 1975, pp. 533–535. MR 0412027 | Zbl 0322.05134

[83] Tolerance relations on semilattices. Commentat. Math. Univ. Carol. 16 (1975), 333–338. MR 0369199 | Zbl 0326.06004

[84] Intersection graphs of semilattices. Mat. Cas. SAV 25 (1975), 345–350. MR 0427185 | Zbl 0326.06005

[85] Tolerances and congruences on tree algebras. 25 (1975), 634–637. MR 0387099 | Zbl 0327.08002

[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) Zbl 0329.05124

[87] A remark on dot-compositions of graphs. J. Indian Math. Soc., N. Ser. 38 (1974, 1975), 221–225. MR 0419303

[88] $(0,1)$-matrices with isomorphic term bigraphs have equal ranks. J. Indian Math. Soc., N. Ser. 39 (1975), 315–319. MR 0498287 | Zbl 0419.05037

[89] Groups and polar graphs. Cas. Pest. Mat. 101 (1976), 2–6. MR 0505793 | Zbl 0319.05118

[90] Hadwiger numbers of finite graphs. 26 (1976), 23–30. MR 0427145 | Zbl 0324.05120

[91] The Hadwiger number of an infinite graph. Math. Slovaca 26 (1976), 153–157. MR 0427146 | Zbl 0326.05105

[92] Embedding trees into block graphs. Czech. Math. J. 26 (1976), 273–279. MR 0447028 | Zbl 0328.05101

[93] Weakly associative lattices and tolerance relations. 26 (1976), 259–269 (with I. Chajda). MR 0401558 | Zbl 0332.06002

[94] On existence conditions for compatible tolerances (with I. Chajda, J. Niederle). 26 (1976), 304–311. MR 0401561

[95] Isomorphisms of polar and polarized graphs. 26 (1976), 339–351. MR 0498288 | Zbl 0341.05121

[96] Analoga of Menger’s theorem for polar and polarized graphs. Czech. Math. J. 26 (1976), 352–360. MR 0498289 | Zbl 0341.05122

[97] Eulerian polar graphs. 26 (1976), 361–364. MR 0505895 | Zbl 0341.05123

[98] Self-derived polar graphs. 26 (1976), 365–370. MR 0498290 | Zbl 0341.05124

[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. MR 0434857 | Zbl 0367.05028

[101] Finite planar vertex-transitive graphs of the regularity degree three. Cas. Pest. Mat. 102 (1977), 1–9. MR 0498238 | Zbl 0341.05114

[102] On a problem of R. Halin concerning subgraphs of infinite graphs. Math. Slovaca 27 (1977), 43–47. MR 0465953 | Zbl 0348.05112

[103] Lattices of tolerances. Cas. Pest. Mat. 102 (1977), 10–24 (with I. Chajda). MR 0450152 | Zbl 0354.08011

[104] Permutable tolerances. Cas. Pest. Mat. 102 (1977), 217–220 (with I. Chajda). MR 0457301 | Zbl 0356.08003

[105] The lattice of all subtrees of a tree. Math. Slovaca 27 (1977), 277–286. MR 0536145 | Zbl 0357.05035

[106] A remark on isotopies of digraphs and permutation matrices. Cas. Pest. Mat. 102 (1977), 230–233. MR 0472590 | Zbl 0359.05025

[107] Tolerance relations on periodic commutative semigroups. 27 (1977), 167–169. MR 0427509 | Zbl 0359.20045

[108] Geodetic graphs which are homeomorphic to complete graphs. Math. Slovaca 27 (1977), 129–132. MR 0463039 | Zbl 0362.05070

[109] Caterpillars. Cas. Pest. Mat. 102 (1977), 179–185. MR 0480125 | Zbl 0367.05029

[110] Minimal compatible tolerances on lattices. Czech. Math. J. 27 (1977), 452–459. MR 0457300 | Zbl 0379.06002

[111] A remark on systems of maximal cliques of a graph. 27 (1977), 617–618. MR 0469823 | Zbl 0378.05039

[112] Infinite directed paths in locally finite digraphs. Cas. Pest. Mat. 103 (1978), 136–140. MR 0480163 | Zbl 0388.05020

[113] On a problem of R. Häggkvist concerning edge-colouring of graphs. Cas. Pest. Mat. 103 (1978), 289–290. MR 0506558

[114] Dot-compositions of graphs. Combinatorics, Keszthely 1976, Colloq. Aath. Soc. Janos. Bolyai 18, 1978, pp. 1169–1176. MR 0519333 | Zbl 0391.05043

[115] The number of isomorphism classes of spanning trees of a graph. Math. Slovaca 28 (1978), 385–388. MR 0534817 | Zbl 0403.05031

[116] Metrics and tolerances. Arch. Math., Brno 14 (1978), 193–200 (with I. Chajda). MR 0512761 | Zbl 0414.06006

[117] A remark on the Čebyšev property. 28 (1978), 311–316. MR 0534999 | Zbl 0428.15003

[118] Derivatives of hypergraphs. 28 (1978), 394–399. MR 0501206 | Zbl 0444.05059

[119] Self-complementary vertex-transitive undirected graphs. 29 (1979), 91–95. MR 0561783 | Zbl 0398.05062

[120] Embedding trees into clique-bridge-clique graphs. Cas. Pest. Mat. 104 (1979), 353–356. MR 0553169 | Zbl 0403.05032

[121] Strongly connected digraphs in which each edge is contained in exactly two cycles. Acta Cybern. 4 (1979), 203–205. MR 0525045 | Zbl 0406.05041

[122] Some remarks on Eulerian graphs. Czech. Math. J. 29 (1979), 564–567. MR 0548218 | Zbl 0407.05061

[123] Tolerances and convexity. 29 (1979), 584–587 (with I. Chajda). MR 0548221 | Zbl 0407.06002

[124] Tolerance relations on direct products of monoids and distributive lattices. Glas. Mat., III. Ser. 14 (1979), 11–16 (with I. Chajda). MR 0544056 | Zbl 0408.08001

[125] Join graph of trees. Czech. Math. J. 30 (1980), 332–335.

[126] Subarborians. Czech. Math. J. 30 (1980), 336–340. MR 0566057 | Zbl 0419.05019

[127] Domatically critical graphs. Czech. Math. J. 30 (1980), 486–489. MR 0583627 | Zbl 0426.05046

[128] Bases of classes of trees closed under subdivisions. 30 (1980), 61–64. MR 0568215 | Zbl 0427.05026

[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ý). MR 0594461 | Zbl 0449.06006

[130] The bichromaticity of a graph. Czech. Math. J. 30 (1980), 655–660. MR 0592329 | Zbl 0477.05041

[131] Decomposition of a complete equipartite graph into isomorphic subgraphs. Math. Slovaca 31 (1981), 165–169 (with P. Tomasta). MR 0611628 | Zbl 0459.05055

[132] Finite spherical geometries. Cas. Pest. Mat. 106 (1981), 206–208. MR 0621184 | Zbl 0471.51012

[133] Intersection number of a graph. Cas. Pest. Mat. 106 (1981), 223–225. MR 0629720 | Zbl 0471.05039

[134] On domatic numbers of graphs. 31 (1981), 91–95. MR 0619511 | Zbl 0476.05063

[135] Some remarks on domatic numbers of graphs. Cas. Pest. Mat. 106 (1981), 373–375. MR 0637816 | Zbl 0476.05063

[136] Graphs of semigroups. Cas. Pest. Mat., 407–408. MR 0637820

[137] On two graph-theoretical problems from the conference at Nová Ves u Branžeže. Cas. Pest. Mat. 106 (1981), 409–413. MR 0637821 | Zbl 0473.05052

[138] Graph representations of finite Abelian groups. 31 (1981), 83–86. MR 0604114 | Zbl 0476.05042

[139] Cyclically simple tournaments. Publ. Math. 28 (1981), 99–102. MR 0625629 | Zbl 0478.05044

[140] On double covers of graphs. 32 (1982), 49–54. MR 0648219 | Zbl 0483.05057

[141] Infinite tree algebras. Cas. Pest. Mat. 107 (1982), 59–68. MR 0651082 | Zbl 0487.05022

[142] Domatic numbers of cube graphs. Math. Slovaca 32 (1982), 117–119. MR 0658244 | Zbl 0487.05057

[143] On two problems of the graph theory. Cas. Pest. Mat. 107 (1982), 109–113. MR 0659739 | Zbl 0492.05058

[144] Elongation in a graph. Math. Slovaca 32 (1982), 291–296. MR 0670005 | Zbl 0494.05034

[145] Homomorphisms of finite bipartite graphs onto complete bipartite graphs. 32 (1982), 361–366. MR 0676572 | Zbl 0504.05056

[146] Logics of bipartite graphs and complete multipartite graphs. Cas. Pest. Mat. 107 (1982), 425–427 (with Z. Andres). MR 0683825 | Zbl 0505.05055

[147] Bichromaticity and minimum degree of a bipartite graph. Glas. Mat., III. Ser. 17 (1982), 237–239. MR 0692496 | Zbl 0506.05039

[148] Domatische Zahlen der Graphen. Rostocker Math. Kolloq. 21 (1982), 69–72. MR 0713636 | Zbl 0517.05054

[149] Adomatic and idomatic numbers of graphs. Math. Slovaca 33 (1983), 99–103. MR 0689285 | Zbl 0507.05059

[150] Isonemality and mononemality of woven fabrics. Apl. Mat. 28 (1983), 194–198. MR 0701738 | Zbl 0515.05027

[151] A distance between isomorphism classes of trees. 33 (1983), 126–130. MR 0687425 | Zbl 0523.05028

[152] Nearly acyclic digraphs. Czech. Math. J. 33 (1983), 164–165. MR 0687429 | Zbl 0515.05034

[153] Domatic number and degrees of vertices of a graph. 33 (1983), 145–147. MR 0699083 | Zbl 0516.05032

[154] Domatically cocritical graphs. Cas. Pest. Mat. 108 (1983), 82–88. MR 0694143 | Zbl 0517.05055

[155] Pure circuits in cube graphs. Cas. Pest. Mat. 108 (1983), 239–240. MR 0716407 | Zbl 0518.05055

[156] Unpath number of a complete multiplicative graph. 33 (1983), 293–296. MR 0713951

[157] Locally tree-like graphs. Cas. Pest. Mat. 108 (1983), 230–238. MR 0716406 | Zbl 0528.05040

[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. MR 0730659 | Zbl 0532.05054

[159] Edge-domatic number of a graph. Czech. Math. J. 33 (1983), 107–110. MR 0687422 | Zbl 0537.05049

[160] On k-domatic numbers of graphs. Czech. Math. J. 33 (1983), 309–313. MR 0699028 | Zbl 0537.05050

[161] Double covers and logics of graphs. 33 (1983), 354–360. MR 0718920 | Zbl 0537.05070

[162] Double covers and logics of graphs. II. Math. Slovaca 33 (1983), 329–334. MR 0720501 | Zbl 0524.05058

[163] Directly decomposable tolerances on direct products of lattices and semilattices. Czech. Math. J. 33 (1983), 519–521 (with I. Chajda). MR 0721081 | Zbl 0538.06008

[164] Homomorphisms of infinite bipartite graphs onto complete bipartite graphs. Czech. Math. J. 33, 545–547. MR 0721085 | Zbl 0543.05058

[165] Tolerances and orderings on semilattices. Arch. Math., Brno 19 (1983), 125–131 (with J. Nieminen, I. Chajda). MR 0725194 | Zbl 0554.06006

[166] Complemented tolerances on lattices. Cas. Pest. Mat. 109 (1984), 54–59 (with I. Chajda). MR 0741208 | Zbl 0536.06007

[167] On a problem of A. Kotzig concerning factorizations of 4-regular graphs. J. Graph Theory 8 (1984), 325–330. MR 0742884 | Zbl 0537.05047

[168] Decomposition of an infinite complete graph into complete bipartite subgraphs. Cas. Pest. Mat. 109 (1984), 266–267. MR 0755591 | Zbl 0545.05058

[169] Tolerances on monounary algebras. Czech. Math. J. 34 (1984), 298–304. MR 0743493 | Zbl 0546.08001

[170] Symmetries of woven fabrics. Apl. Mat. 29 (1984), 14–22. MR 0729949 | Zbl 0574.05012

[171] On $k$-ply domatic numbers of graphs. Math. Slovaca 34 (1984), 313–318. MR 0756989 | Zbl 0602.05039

[172] Semidomatic numbers of directed graphs. Math. Slovaca 34 (1984), 371–374. MR 0775244 | Zbl 0602.05038

[173] Cyclicity of a complete 3-equipartite graph. Arch. Math., Brno 21 (1985), 1–3. MR 0818301 | Zbl 0574.05028

[174] Bichromaticity and domatic number of a bipartite graph. Cas. Pest. Mat. 110 (1985), 113–115. MR 0796560 | Zbl 0575.05046

[175] Graphs with prescribed neighbourhood graphs. Math. Slovaca 35 (1985), 195–197. MR 0795015 | Zbl 0579.05045

[176] Comparison of various distances between isomorphism classes of graphs. Cas. Pest. Mat. 110 (1985), 289–293. MR 0808079 | Zbl 0579.05056

[177] Domatic numbers of uniform hypergraphs. Arch. Math., Brno 21 (1985), 129–133. MR 0833123 | Zbl 0605.05032

[178] Odd graphs. Arch. Math., Brno 21 (1985), 181–187. MR 0833129 | Zbl 0591.05062

[179] Every finite chain is the tolerance lattice of some lattice. Glas. Mat., III. Ser. 20 (1985), 3–6. MR 0818608 | Zbl 0587.06001

[180] Domatic number and linear arboricity of cacti. Math. Slovaca 36 (1986), 49–54. MR 0832370 | Zbl 0583.05050

[181] Neighbourhood tournaments. Math. Slovaca 36 (1986), 241–244. MR 0866624 | Zbl 0599.05027

[182] Edge neighbourhood graphs. Czech. Math. J. 36 (1986), 44–47. MR 0822865 | Zbl 0599.05054

[183] Disconnected neighbourhood graphs. Math. Slovaca 36 (1986), 109–110. MR 0849700 | Zbl 0603.05039

[184] Connected domatic number of a graph. Math. Slovaca 36 (1986), 387–392. MR 0871778 | Zbl 0625.05042

[185] Tolerances on graph algebras. Czech. Math. J. 37 (1987), 313–317. MR 0882602 | Zbl 0623.05022

[186] A characterization of tolerance-distributive tree semilattices. Czech. Math. J. 37 (1987), 175–180 (with I. Chajda). MR 0882591 | Zbl 0625.06002

[187] Neighbourhood digraphs. Arch. Math., Brno 23 (1987), 69–70. MR 0930322 | Zbl 0626.05018

[188] The distance between a graph and its complement. 37 (1987), 120–123. MR 0875132 | Zbl 0632.05046

[189] Edge-distance between isomorphism classes of graphs. Cas. Pest. Mat. 112 (1987), 233–237. MR 0905968 | Zbl 0646.05035

[190] Distances between directed graphs. Cas. Pest. Mat. 112 (1987), 359–367. MR 0921325 | Zbl 0643.05033

[191] Locally disconnected graphs with large numbers of edges. 37 (1987), 195–198 (with Z. Ryjáček). MR 0899435 | Zbl 0673.05060

[192] Natural bijections between directed and undirected self-complementary graphs. Math. Slovaca 37 (1987), 363–366. MR 0916944 | Zbl 0659.05051

[193] On a problem of P. Vestergaard concerning circuits in graphs. Czech. Math. J. 37 (1987), 318–319. MR 0882603 | Zbl 0676.05064

[194] Block-closed subgraphs and $q$-partitions of graphs. Zastosow. Mat. 19 (1987), 629–634. MR 0951378 | Zbl 0721.05041

[195] Locally snake-like graphs. Math. Slovaca 88 (1988), 85–88. MR 0945083 | Zbl 0641.05031

[196] The distance between various orientations of a graph. 38 (1988), 19–25. MR 0945076 | Zbl 0644.05024

[197] Complementarily domatic number of a graph. Math. Slovaca 38 (1988), 27–32. MR 0945077 | Zbl 0641.05045

[198] Polytopic locally linear graphs. Math. Slovaca 38 (1988), 99–103. MR 0945363 | Zbl 0642.05029

[199] Total domatic number of cacti. Math. Slovaca 38 (1988), 207–214. MR 0977897 | Zbl 0654.05059

[200] Two local properties of graphs. Cas. Pest. Mat. 113 (1988), 113–121. MR 0949039 | Zbl 0656.05056

[201] Small directed graphs as neighbourhood graphs. 38 (1988), 269–273. MR 0946295 | Zbl 0657.05031

[202] The graph of labellings of a given graph. Math. Slovaca 38 (1988), 297–300. MR 0978758 | Zbl 0665.05041

[203] Tolerances of polyunary algebras. Arch. Math., Brno 24 (1988), 1–4. MR 0983002 | Zbl 0666.08002

[204] Tolerances and congruences on implication algebras. Czech. Math. J. 38 (1988), 207–217 (with I. Chajda). MR 0946288 | Zbl 0678.08003

[205] A remark on signed posets and signed graphs. Czech. Math. J. 38 (1988), 673–676. MR 0962910 | Zbl 0679.05067

[206] Partitionability of trees. 38 (1988), 677–681. MR 0962911 | Zbl 0672.05021

[207] The bigraph decomposition number of a graph. Cas. Pest. Mat. 113 (1988), 56–59. MR 0930806 | Zbl 0698.05043

[208] A remark on cancellation in direct products of graphs. Cas. Pest. Mat. 114 (1989), 35–38. MR 0990114 | Zbl 0663.05053

[209] Spanning trees of locally finite graphs. Czech. Math. J. 39 (1989), 193–197. MR 0992126 | Zbl 0679.05023

[210] Centers of directed cacti. Cas. Pest. Mat. 114 (1989), 225–229. MR 1016631 | Zbl 0681.05034

[211] Total domatic number and degrees of vertices of a graph. Math. Slovaca 39 (1989), 7–11. MR 1016324 | Zbl 0688.05066

[212] Neighbourhood realizations of complements of intersection graphs. Math. Slovaca 39 (1989), 361–363. MR 1094758 | Zbl 0757.05098

[213] Contraction distance between isomorphism classes of graphs. Cas. Pest. Mat. 115 (1990), 211–216. MR 1054008 | Zbl 0731.05016

[214] Domatic numbers of lattice graphs. Czech. Math. J. 40 (1990), 113–115. MR 1032364 | Zbl 0735.05043

[215] The least connected non-transitive graph with constant neighbourhoods. Czech. Math. J. 40 (1990), 619–624. MR 1084898

[216] Regular totally domatically full graphs. Discrete Math. 86 (1990), 71–79. MR 1088561 | Zbl 0745.05065

[217] Domination in cubic graphs. Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 1990, pp. 727–735. MR 1100097 | Zbl 0745.05064

[218] Edge-domatically full graphs. Math. Slovaca 40 (1990), 359–365. MR 1120966 | Zbl 0757.05090

[219] A remark on self-centroidal graphs. Zastosow. Mat. 21 (1991), 109–112. MR 1109911 | Zbl 0742.05073

[220] Edge-domatic numbers of cacti. Math. Bohem. 116 (1991), 91–95. MR 1100426 | Zbl 0743.05032

[221] Total edge-domatic number of a graph. Math. Bohem. 116 (1991), 96–100. MR 1100427 | Zbl 0743.05033

[222] Distances between rooted trees. Math. Bohem. 116 (1991), 101–107. MR 1100428 | Zbl 0743.05019

[223] Domination in cubes. Math. Slovaca 41 (1991), 17–19. MR 1094979 | Zbl 0753.05056

[224] Every connected acyclic digraph of height 1 is neighbourhood-realizable. Arch. Math., Brno 27a (1991), 133–135. MR 1189650 | Zbl 0758.05056

[225] Semidomatic and total semidomatic numbers of directed graphs. Math. Bohem. 117 (1992), 1–8. MR 1154049 | Zbl 0754.05041

[226] Distances between graphs. Combinatorics, graphs and complexity. Proc. 4th Czechosl. Symp., Prachatice, 1990. Ann. Discrete Math. 51 (1992), 355–361.

[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. Zbl 0772.05058

[228] Tolerances on poset algebras. Math. Bohem. 117 (1992), 93–97. MR 1154058 | Zbl 0765.06004

[229] Equivalences between isomorphism classes in infinite graphs. Math. Bohem. 117 (1992), 151–155. MR 1165891

[230] Edge shift distance between trees. Arch. Math., Brno 28 (1992), 5–9. MR 1201860 | Zbl 0788.05027

[231] Domination in Kneser graphs. 118 (1993), 147–152 (with J. Ivančo). MR 1223479 | Zbl 0778.05043

[232] Graphs in which each pair of vertices has exactly two common neighbours. Math. Bohem. 118 (1993), 163–165. MR 1223481 | Zbl 0777.05092

[233] Distances between partially ordered sets. Math. Bohem. 118 (1993), 167–170. MR 1223482 | Zbl 0787.06004

[234] A modification of the median of a tree. Math. Bohem. 118 (1993), 195–200. MR 1223485 | Zbl 0778.05030

[235] Representation of undirected graphs by anticommutative conservative groupoids. 119 (1994), 231–237. MR 1305526 | Zbl 0828.20074

[236] Extended trees of graphs. Math. Bohem. 119 (1994), 239–244. MR 1305527 | Zbl 0814.05027

[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. Zbl 0828.20073

[238] Cut-vertices and domination in graphs. Math. Bohem. 120 (1995), 135–143 (with P. D. Vestergaard). MR 1357598 | Zbl 0839.05052

[239] Domination in graphs with few edges. Math. Bohem. 120 (1995), 405–410. MR 1415088 | Zbl 0844.05058

[240] Edge-domatic numbers of directed graphs. Czech. Math. J. 45 (1995), 449–455. MR 1344510 | Zbl 0847.05063

[241] Median properties of graphs with small diameters. 120 (1995), 319–323. MR 1369690 | Zbl 0847.05052

[242] Subtraction semigroups. Math. Bohem. 120 (1995), 445–447. MR 1415091 | Zbl 0851.20057

[243] Some remarks on domination in cubic graphs. Discrete Math. 158 (1996), 249–255. MR 1411121 | Zbl 0861.05034

[244] Atomary tolerances on finite algebras. Math. Bohem. 121 (1996), 35–39. MR 1388172 | Zbl 0863.08003

[245] The graph theory hymn. Discuss. Math., Graph Theory 16 (1996), 219–221 (with Z. Ryjáček, M. Meszka, J. Nowakz). (Czech, Polish) Zbl 0877.05060

[246] Antidomatic number of a graph. Arch. Math., Brno 33 (1996), 191–195. MR 1478772 | Zbl 0909.05031

[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. Zbl 0959.05081

[248] Poison from Erdős. Geombinatorics 6 (1997), 117–118. MR 1439077

[249] Circular distance in directed graphs. Math. Bohem. 122 (1997), 113–117. MR 1460940 | Zbl 0889.05045

[250] On two transformations of graphs. Math. Bohem. 122 (1997), 357–363. MR 1489396 | Zbl 0898.05022

[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. MR 1605698 | Zbl 0894.05026

[252] Location-domatic number of a graph. Math. Bohem. 123 (1998), 67–71. MR 1618719 | Zbl 0898.05034

[253] On the simplex graph operator. Discuss. Math., Graph Theory 18 (1998), 165–169. MR 1687831 | Zbl 0930.05084

[254] Domination in products of circuits. Acta Univ. M. Belii, Ser. Math. 6 (1998), 57–62. MR 1683016 | Zbl 0933.05116

[255] Dominating functions of graphs with two values. 123 (1998), 263–270. MR 1645438 | Zbl 0933.05111

[256] Graphs maximal with respect to absence of Hamiltonian paths. Discuss. Math., Graph Theory 18 (1998), 205–208. MR 1687847 | Zbl 0935.05062

[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. Zbl 1114.05303

[258] Point set domatic numbers of graphs. Math. Bohem. 124 (1999), 77–82. MR 1687413 | Zbl 0933.05112

[259] A remark on graph operators. Math. Bohem. 124 (1999), 83–85. MR 1687488 | Zbl 0933.05148

[260] Locally regular graphs. 125 (2000), 481–484. MR 1802296 | Zbl 0963.05119

[261] A note on periodicity of the 2-distance operator. Discuss. Math., Graph Theory 20 (2000), 267–269. MR 1817497 | Zbl 0979.05038

[262] On a problem concerning stratified graphs. Czech. Math. J. 50 (2000), 47–49. MR 1745457 | Zbl 1033.05035

[263] Signed total domination number of a graph. Czech. Math. J. 51 (2001), 225–229. MR 1844306 | Zbl 0977.05096

[264] Periodicity of graph operators. Discrete Math. 235 (2001), 349–351. MR 1829865 | Zbl 0984.05072

[265] On 2-periodic graphs of a certain graph operator. Discuss. Math., Graph Theory 21 (2001), 13–30 (with I. Havel). MR 1867484 | Zbl 0990.05107

[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. MR 1854563 | Zbl 0991.08003

[267] The 3-path-step operator on trees and unicyclic graphs. 127 (2002), 33–40. MR 1895244 | Zbl 0995.05076

[268] On signed edge domination numbers of trees. Math. Bohem. 127 (2002), 49–55. MR 1895246 | Zbl 0995.05112

[269] Domination in generalized Petersen graphs. Czech. Math. J. 52 (2002), 11–16. MR 1885452 | Zbl 0995.05107

[270] On a problem of E. Prisner concerning the biclique operator. Math. Bohem. 127 (2002), 371–373. MR 1931321 | Zbl 1003.05048

[271] Induced-paired domatic numbers of graphs. 127 (2002), 591–596. MR 1942644 | Zbl 1003.05078

[272] Edge-dominations in graphs of cubes. Czech. Math. J. 52 (2002), 875–879. MR 1940066

[273] Algebraic approach to locally finite trees with one end. 128 (2003), 37–44. MR 1973423 | Zbl 1010.05019

[274] Infinite paths in locally finite graphs and in their spanning trees. Math. Bohem. 128 (2003), 71–76. MR 1974546 | Zbl 1010.05039

[275] Domination in bipartite graphs and in their complements. 53 (2003), 241–247. MR 1983448 | Zbl 1021.05074

[276] On a problem concerning $k$-subdomination numbers of graphs. Czech. Math. J. 53 (2003), 627–629. MR 2000058 | Zbl 1080.05526

[277] A remark on branch weights in countable trees. 129 (2004), 29–31. MR 2048784 | Zbl 1050.05028

[278] Signed 2-domination in caterpillers. Math. Bohem. 129 (2004), 393–398. MR 2102612

[279] Signed domatic number of a graph. Discrete Appl. Math. 150 (2005), 261–267 (with L. Volkmann). MR 2161350 | Zbl 1079.05071

[280] Remarks on restrained domination and total restrained domination in graphs. Czech. Math. J. 555 (2005), 393–396. MR 2137145 | Zbl 1081.05050

[281] Signed domination numbers of directed graphs. Czech. Math. J. 55 (2005), 479–482. MR 2137154 | Zbl 1081.05042

[282] Signed and minus domination in bipartite graphs. Czech. Math. J. 56 (2006), 587–590. MR 2291758 | Zbl 1164.05428