Plesnik, Jan A simple proof of the perfect matching theorem. (English) Zbl 0436.05054 Mat. Čas., Slovensk. Akad. Vied 25, 185-186 (1975). MSC: 05C99 PDFBibTeX XMLCite \textit{J. Plesnik}, Mat. Čas., Slovensk. Akad. Vied 25, 185--186 (1975; Zbl 0436.05054) Full Text: EuDML
Jendrol’, Stanislav On the non-existence of certain nearly regular planar maps with two exceptional faces. (English) Zbl 0331.05104 Mat. Čas., Slovensk. Akad. Vied 25, 159-164 (1975). MSC: 05C10 52A10 PDFBibTeX XMLCite \textit{S. Jendrol'}, Mat. Čas., Slovensk. Akad. Vied 25, 159--164 (1975; Zbl 0331.05104) Full Text: EuDML
Zelinka, Bohdan Intersection graphs of semilattices. (English) Zbl 0326.06005 Mat. Čas., Slovensk. Akad. Vied 25, 345-350 (1975). MSC: 06B05 05C99 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 25, 345--350 (1975; Zbl 0326.06005) Full Text: EuDML
Gliviak, Ferdinand Maximal graphs with given connectivity and edge-connectivity. (English) Zbl 0321.05122 Mat. Čas., Slovensk. Akad. Vied 25, 99-103 (1975). MSC: 05C35 05C30 PDFBibTeX XMLCite \textit{F. Gliviak}, Mat. Čas., Slovensk. Akad. Vied 25, 99--103 (1975; Zbl 0321.05122) Full Text: EuDML
Gliviak, Ferdinand On certain edge-critical graphs of a given diameter. (English) Zbl 0311.05126 Mat. Čas., Slovensk. Akad. Vied 25, 249-263 (1975). MSC: 05C35 PDFBibTeX XMLCite \textit{F. Gliviak}, Mat. Čas., Slovensk. Akad. Vied 25, 249--263 (1975; Zbl 0311.05126) Full Text: EuDML
Zelinka, Bohdan Intersection graphs of graphs. (English) Zbl 0309.05128 Mat. Čas., Slovensk. Akad. Vied 25, 129-133 (1975). MSC: 05C99 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 25, 129--133 (1975; Zbl 0309.05128) Full Text: EuDML
Jacos, Vasil On j-pancyclic graphs. (English) Zbl 0307.05112 Mat. Čas., Slovensk. Akad. Vied 25, 281-286 (1975). MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{V. Jacos}, Mat. Čas., Slovensk. Akad. Vied 25, 281--286 (1975; Zbl 0307.05112) Full Text: EuDML
Zpinka, Bohdan Intersection graphs of set families closed under intersection and satisfying the descending chain condition. (English) Zbl 0306.05129 Mat. Čas., Slovensk. Akad. Vied 25, 193-205 (1975). MSC: 05C99 PDFBibTeX XMLCite \textit{B. Zpinka}, Mat. Čas., Slovensk. Akad. Vied 25, 193--205 (1975; Zbl 0306.05129) Full Text: EuDML
Zelinka, Bohdan Involutory pairs of vertices in transitive graphs. (English) Zbl 0306.05108 Mat. Čas., Slovensk. Akad. Vied 25, 221-222 (1975). MSC: 05C25 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 25, 221--222 (1975; Zbl 0306.05108) Full Text: EuDML
Zelinka, Bohdan Finite vertex-transitive planar graphs of the regularity degree four or five. (English) Zbl 0306.05107 Mat. Čas., Slovensk. Akad. Vied 25, 271-280 (1975). MSC: 05C25 05C10 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 25, 271--280 (1975; Zbl 0306.05107) Full Text: EuDML
Sekanina, Milan Graphs and betweeness. (English) Zbl 0299.05114 Mat. Čas., Slovensk. Akad. Vied 25, 41-47 (1975). MSC: 05C35 05C05 PDFBibTeX XMLCite \textit{M. Sekanina}, Mat. Čas., Slovensk. Akad. Vied 25, 41--47 (1975; Zbl 0299.05114) Full Text: EuDML
Zat’kova, Viera Partial planes and pairing systems. (Russian) Zbl 0325.50016 Mat. Čas., Slovensk. Akad. Vied 24, 325-342 (1974). MSC: 51E20 05B25 PDFBibTeX XMLCite \textit{V. Zat'kova}, Mat. Čas., Slovensk. Akad. Vied 24, 325--342 (1974; Zbl 0325.50016) Full Text: EuDML
Sedlacek, Jiri The reconstruction of a connected graph from its spanning trees. (English) Zbl 0294.05102 Mat. Čas., Slovensk. Akad. Vied 24, 307-314 (1974). MSC: 05C05 05C99 PDFBibTeX XMLCite \textit{J. Sedlacek}, Mat. Čas., Slovensk. Akad. Vied 24, 307--314 (1974; Zbl 0294.05102) Full Text: EuDML
Zelinka, Bohdan The number of non-isomorphic Hamiltonian circuits in an \(n\)-dimensional cube. (English) Zbl 0287.94019 Mat. Čas., Slovensk. Akad. Vied 24, 203-208 (1974). MSC: 94B99 05C99 94C10 68Q45 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 24, 203--208 (1974; Zbl 0287.94019) Full Text: EuDML
Schwarz, Štefan Unions of powers of binary relations. (Russian) Zbl 0286.20075 Mat. Čas., Slovensk. Akad. Vied 24, 161-171 (1974). MSC: 20M10 05C20 08A05 03E20 PDFBibTeX XMLCite \textit{Š. Schwarz}, Mat. Čas., Slovensk. Akad. Vied 24, 161--171 (1974; Zbl 0286.20075) Full Text: EuDML
Jacos, V.; Jendrol’, S. A problem concerning j-pancyclic graphs. (English) Zbl 0285.05111 Mat. Čas., Slovensk. Akad. Vied 24, 259-262 (1974). MSC: 05C35 05C10 PDFBibTeX XMLCite \textit{V. Jacos} and \textit{S. Jendrol'}, Mat. Čas., Slovensk. Akad. Vied 24, 259--262 (1974; Zbl 0285.05111) Full Text: EuDML
Novak, Jiri Edge bases of complete uniform hypergraphs. (English) Zbl 0273.05132 Mat. Čas., Slovensk. Akad. Vied 24, 43-57 (1974). MSC: 05C99 05C35 05A05 PDFBibTeX XMLCite \textit{J. Novak}, Mat. Čas., Slovensk. Akad. Vied 24, 43--57 (1974; Zbl 0273.05132) Full Text: EuDML
Zelinka, Bohdan Quasigroups and factorisation of complete digraphs. (English) Zbl 0271.20039 Mat. Čas., Slovensk. Akad. Vied 23, 333-341 (1973). MSC: 20N05 05C25 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 23, 333--341 (1973; Zbl 0271.20039) Full Text: EuDML
Palumbíny, Daniel; Znám, Štefan On decompositions of complete graphs into factors with given radii. (English) Zbl 0269.05121 Mat. Čas., Slovensk. Akad. Vied 23, 306-316 (1973). Reviewer: Štefan Znám MSC: 05C99 PDFBibTeX XMLCite \textit{D. Palumbíny} and \textit{Š. Znám}, Mat. Čas., Slovensk. Akad. Vied 23, 306--316 (1973; Zbl 0269.05121) Full Text: EuDML
Zelinka, Bohdan Intersection graphs of lattices. (English) Zbl 0267.06002 Mat. Čas., Slovensk. Akad. Vied 23, 216-222 (1973). MSC: 06B05 05C99 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 23, 216--222 (1973; Zbl 0267.06002) Full Text: EuDML
Zelinka, Bohdan Edge-colourings of permutation graphs. (English) Zbl 0262.05109 Mat. Čas., Slovensk. Akad. Vied 23, 193-198 (1973). MSC: 05C15 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 23, 193--198 (1973; Zbl 0262.05109) Full Text: EuDML
Bosak, Juraj; Fiamcik, Jozef Chromatic index of Hamiltonian graphs. (English) Zbl 0257.05105 Mat. Čas., Slovensk. Akad. Vied 23, 88-94 (1973). MSC: 05C15 05C35 05Cxx 57M15 PDFBibTeX XMLCite \textit{J. Bosak} and \textit{J. Fiamcik}, Mat. Čas., Slovensk. Akad. Vied 23, 88--94 (1973; Zbl 0257.05105) Full Text: EuDML
Jucovic, Ernest; Walther, Hansjoachim Über längste Kreise in flächenregulären Polyedergraphen. (German) Zbl 0256.05104 Mat. Čas., Slovensk. Akad. Vied 23, 164-169 (1973). MSC: 05C10 52A15 05C35 PDFBibTeX XMLCite \textit{E. Jucovic} and \textit{H. Walther}, Mat. Čas., Slovensk. Akad. Vied 23, 164--169 (1973; Zbl 0256.05104) Full Text: EuDML
Brezina, Jaroslav The use of computers for the investigation of certain decompositions of a complete graph. (Slovak) Zbl 0249.05135 Mat. Čas., Slovensk. Akad. Vied 23, 17-33 (1973). MSC: 05C99 05-04 PDFBibTeX XMLCite \textit{J. Brezina}, Mat. Čas., Slovensk. Akad. Vied 23, 17--33 (1973; Zbl 0249.05135)
Kaucký, Josef Some remarks on a combinatorial problem. (English) Zbl 0262.05012 Mat. Čas., Slovensk. Akad. Vied 22, 215-218 (1972). MSC: 05-03 05A19 15A15 PDFBibTeX XMLCite \textit{J. Kaucký}, Mat. Čas., Slovensk. Akad. Vied 22, 215--218 (1972; Zbl 0262.05012) Full Text: EuDML
Palumbiny, Daniel On a certain type of decompositions of complete graphs into factors with equal diameters. (English) Zbl 0247.05160 Mat. Čas., Slovensk. Akad. Vied 22, 235-242 (1972). MSC: 05C99 PDFBibTeX XMLCite \textit{D. Palumbiny}, Mat. Čas., Slovensk. Akad. Vied 22, 235--242 (1972; Zbl 0247.05160) Full Text: EuDML
Plesnik, Jan Connectivity of regular graphs and the existence of 1-factors. (English) Zbl 0247.05159 Mat. Čas., Slovensk. Akad. Vied 22, 310-318 (1972). MSC: 05C99 05C35 PDFBibTeX XMLCite \textit{J. Plesnik}, Mat. Čas., Slovensk. Akad. Vied 22, 310--318 (1972; Zbl 0247.05159) Full Text: EuDML
Zelinka, Bohdan Reconstructing a graph from the incidence relation on its edge set. (English) Zbl 0239.05136 Mat. Čas., Slovensk. Akad. Vied 22, 164-171 (1972). MSC: 05C99 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 22, 164--171 (1972; Zbl 0239.05136) Full Text: EuDML
Kaucký, Josef A contribution to the theory of permutations. (English) Zbl 0245.05005 Mat. Čas., Slovensk. Akad. Vied 21, 82-86 (1971). MSC: 05A15 05A10 PDFBibTeX XMLCite \textit{J. Kaucký}, Mat. Čas., Slovensk. Akad. Vied 21, 82--86 (1971; Zbl 0245.05005) Full Text: EuDML
Zelinka, Bohdan The decomposition of a digraph into isotopic subgraphs. (English) Zbl 0223.05110 Mat. Čas., Slovensk. Akad. Vied 21, 221-226 (1971). MSC: 05C20 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 21, 221--226 (1971; Zbl 0223.05110) Full Text: EuDML
Bartós, Pavel Some combinatorial inequalities. (Slovak) Zbl 0222.05010 Mat. Čas., Slovensk. Akad. Vied 21, 219-220 (1971). MSC: 05A20 PDFBibTeX XMLCite \textit{P. Bartós}, Mat. Čas., Slovensk. Akad. Vied 21, 219--220 (1971; Zbl 0222.05010) Full Text: EuDML
Bosák, J.; Erdős, Paul; Rosa, A. Decompositions of complete graphs into factors with diameter two. (English) Zbl 0213.51003 Mat. Čas., Slovensk. Akad. Vied 21, 14-28 (1971). MSC: 05C70 PDFBibTeX XMLCite \textit{J. Bosák} et al., Mat. Čas., Slovensk. Akad. Vied 21, 14--28 (1971; Zbl 0213.51003)
Fiamčík, J. Simultaneous colouring of 4-valent maps. (English) Zbl 0213.50704 Mat. Čas., Slovensk. Akad. Vied 21, 9-13 (1971). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Fiamčík}, Mat. Čas., Slovensk. Akad. Vied 21, 9--13 (1971; Zbl 0213.50704)
Harary, Frank; Manvel, B. On the number of cycles in a graph. (English) Zbl 0209.55404 Mat. Čas., Slovensk. Akad. Vied 21, 55-63 (1971). MSC: 05C38 05C30 05C20 PDFBibTeX XMLCite \textit{F. Harary} and \textit{B. Manvel}, Mat. Čas., Slovensk. Akad. Vied 21, 55--63 (1971; Zbl 0209.55404) Full Text: EuDML
Koman, M. Extremal crossing numbers of complete k-chromatic graphs. (English) Zbl 0209.27902 Mat. Čas., Slovensk. Akad. Vied 20, 315-325 (1970). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{M. Koman}, Mat. Čas., Slovensk. Akad. Vied 20, 315--325 (1970; Zbl 0209.27902) Full Text: EuDML
Znám, Štefan Decomposition of the complete directed graph into two factors with given diameters. (English) Zbl 0206.52802 Mat. Čas., Slovensk. Akad. Vied 20, 254-256 (1970). Reviewer: Štefan Znám MSC: 05C70 05C20 PDFBibTeX XMLCite \textit{Š. Znám}, Mat. Čas., Slovensk. Akad. Vied 20, 254--256 (1970; Zbl 0206.52802) Full Text: EuDML
Zelinka, B. The decomposition of a general graph according to a given Abelian group. (English) Zbl 0206.26203 Mat. Čas., Slovensk. Akad. Vied 20, 281-292 (1970). MSC: 05C25 PDFBibTeX XMLCite \textit{B. Zelinka}, Mat. Čas., Slovensk. Akad. Vied 20, 281--292 (1970; Zbl 0206.26203) Full Text: EuDML
Tomová, E. On the decomposition of the complete directed graph into factors with given diameters. (English) Zbl 0205.28504 Mat. Čas., Slovensk. Akad. Vied 20, 257-261 (1970). MSC: 05C70 05C20 PDFBibTeX XMLCite \textit{E. Tomová}, Mat. Čas., Slovensk. Akad. Vied 20, 257--261 (1970; Zbl 0205.28504) Full Text: EuDML
Glivjak, Ferdinand; Plesník, Ján On the existence of certain graphs with diameter two. (English) Zbl 0187.45701 Mat. Čas., Slovensk. Akad. Vied 19, 276-282 (1969). Reviewer: Ján Plesník MSC: 05Cxx PDFBibTeX XMLCite \textit{F. Glivjak} and \textit{J. Plesník}, Mat. Čas., Slovensk. Akad. Vied 19, 276--282 (1969; Zbl 0187.45701) Full Text: EuDML
Glivjak, Ferdinand; Kyš, Peter; Plesník, Ján On irreducible graphs of diameter two without triangles. (English) Zbl 0185.27804 Mat. Čas., Slovensk. Akad. Vied 19, 149-157 (1969). Reviewer: Ján Plesník MSC: 05Cxx PDFBibTeX XMLCite \textit{F. Glivjak} et al., Mat. Čas., Slovensk. Akad. Vied 19, 149--157 (1969; Zbl 0185.27804) Full Text: EuDML
Glivjak, Ferdinand; Kyš, Peter; Plesník, Ján On the extension of graphs with a given diameter without superfluous edges. (English) Zbl 0185.27803 Mat. Čas., Slovensk. Akad. Vied 19, 92-101 (1969). Reviewer: Ferdinand Glivjak MSC: 05Cxx PDFBibTeX XMLCite \textit{F. Glivjak} et al., Mat. Čas., Slovensk. Akad. Vied 19, 92--101 (1969; Zbl 0185.27803) Full Text: EuDML
Znám, Štefan On \(k\)-thin sets and \(n\)-extensive graphs. (English) Zbl 0173.01901 Mat. Čas., Slovensk. Akad. Vied 17, 297-307 (1967). Reviewer: John D. Dixon MSC: 11B75 05A18 05C99 PDFBibTeX XMLCite \textit{Š. Znám}, Mat. Čas., Slovensk. Akad. Vied 17, 297--307 (1967; Zbl 0173.01901) Full Text: EuDML
Znám, Štefan Equivalence of a number-theoretical problem with a problem from the graph theory. (English) Zbl 0171.00606 Mat. Čas., Slovensk. Akad. Vied 17, 240-241 (1967). Reviewer: Walter Wessel (Berlin) MSC: 11B75 05C30 05D05 05D10 PDFBibTeX XMLCite \textit{Š. Znám}, Mat. Čas., Slovensk. Akad. Vied 17, 240--241 (1967; Zbl 0171.00606) Full Text: EuDML
Dénes, József Algebraic and combinatorial characterization of Latin squares. I. (English) Zbl 0153.33002 Mat. Čas., Slovensk. Akad. Vied 17, 249-267 (1967). Reviewer: L. D. Baumert MSC: 05B15 05-02 PDFBibTeX XMLCite \textit{J. Dénes}, Mat. Čas., Slovensk. Akad. Vied 17, 249--267 (1967; Zbl 0153.33002) Full Text: EuDML Link