• DML-CZ Home

05C30 Enumeration of graphs and maps (23 articles)

• Sigarreta, Saylí; Sigarreta, Saylé; Cruz-Suárez, Hugo: On upper bounds for total $k$-domination number via the probabilistic method. (English). Kybernetika, vol. 59 (2023), issue 4, pp. 537-547
• Milovanović, Emina; Bozkurt Altındağ, Şerife Burcu; Matejić, Marjan; Milovanović, Igor: Inequalities for real number sequences with applications in spectral graph theory. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 3, pp. 783-799
• Chybová, Lucie: Šachové úlohy v kombinatorice. (Czech) [Chessboard Problems in Combinatorics]. Pokroky matematiky, fyziky a astronomie, vol. 63 (2018), issue 2, pp. 125-147
• Bína, Vladislav; Přibil, Jiří: Note on enumeration of labeled split graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 56 (2015), issue 2, pp. 133-137
• 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
• Bhatti, Faqir M.; Das, Kinkar Ch.; Ahmed, Syed A.: On the energy and spectral properties of the he matrix of hexagonal systems. (English). Czechoslovak Mathematical Journal, vol. 63 (2013), issue 1, pp. 47-63
• Ždímalová, Mária; Staneková, Ľubica: Asymptotic comparison of two constructions for large digraphs of given degree and diameter. (English). Acta Mathematica Universitatis Ostraviensis, vol. 17 (2009), issue 1, pp. 5-9
• Chen, Zhibo: Spectra of extended double cover graphs. (English). Czechoslovak Mathematical Journal, vol. 54 (2004), issue 4, pp. 1077-1082
• Liu, BoLian: $k$-common consequents in Boolean matrices. (English). Czechoslovak Mathematical Journal, vol. 46 (1996), issue 3, pp. 523-536
• Hliněný, Petr; Kuběna, Aleš: A note on intersection dimensions of graph classes. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 36 (1995), issue 2, pp. 255-261
• Marcu, Dănuţ: Note on Turán's graph. (English). Czechoslovak Mathematical Journal, vol. 43 (1993), issue 3, pp. 499-501
• Zelinka, Bohdan: Natural bijections between directed and undirected self-complementary graphs. (English). Mathematica Slovaca, vol. 37 (1987), issue 4, pp. 363-366
• Vítek, Milan: Graphs and quasitrivial groupoids. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 27 (1986), issue 1, pp. 3-15
• Kepka, Tomáš; Kratochvíl, Jan: Graphs and associative triples in quasitrivial groupoids. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 25 (1984), issue 4, pp. 679-687
• Širáň, Jozef: An enumeration theorem for rooted graphs. (English). Mathematica Slovaca, vol. 33 (1983), issue 1, pp. 29-34
• Horák, Peter: Enumeration of graphs maximal with respect to connectivity. (English). Mathematica Slovaca, vol. 32 (1982), issue 1, pp. 81-84
• Niepel, Ľudovít; Tomasta, Pavel: Elevation of a graph. (English). Czechoslovak Mathematical Journal, vol. 31 (1981), issue 3, pp. 475-483
• Koubek, Václav; Rödl, Vojtěch: On number of covering arcs in orderings. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 22 (1981), issue 4, pp. 721-733
• Horák, Peter; Továrek, Leoš: On Hamiltonian cycles of complete $n$-partite graphs. (English). Mathematica Slovaca, vol. 29 (1979), issue 1, pp. 43-47
• Gliviak, Ferdinand: Maximal Graphs with Given Connectivity and Edge-Connectivity. (English). Matematický časopis, vol. 25 (1975), issue 2, pp. 99-103
• Johnson, R. H.: A new class of enumeration problems. (English). Czechoslovak Mathematical Journal, vol. 24 (1974), issue 4, pp. 573-583
• Harary, Frank; Manvel, Bennet: On the number of cycles in a graph. (English). Matematický časopis, vol. 21 (1971), issue 1, pp. 55-63
• Harary, Frank; Palmer, Edgar M.: On the number of forests. (English). Matematický časopis, vol. 19 (1969), issue 2, pp. 110-112