• DML-CZ Home

05C70 Factorization, matching, covering and packing (92 articles)

• Mao, Yaping; Melekian, Christopher; Cheng, Eddie: A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs. (English). Czechoslovak Mathematical Journal, vol. 73 (2023), issue 1, pp. 237-244
• Lin, Jing: Maximum bipartite subgraphs in $H$-free graphs. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 3, pp. 621-635
• Pu, Liqun; Tang, Yuan; Gao, Xiaoli: Packing four copies of a tree into a complete bipartite graph. (English). Czechoslovak Mathematical Journal, vol. 72 (2022), issue 1, pp. 39-57
• Ezhilarasi, Arockiajeyaraj P.; Muthusamy, Appu: Decomposition of Cartesian product of complete graphs into paths and stars with four edges. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 62 (2021), issue 3, pp. 273-289
• Li, Yinkui; Mao, Yaping; Wang, Zhao; Wei, Zongtian: Generalized connectivity of some total graphs. (English). Czechoslovak Mathematical Journal, vol. 71 (2021), issue 3, pp. 623-640
• Nyul, Gábor; Rácz, Gabriella: Matchings in complete bipartite graphs and the $r$-Lah numbers. (English). Czechoslovak Mathematical Journal, vol. 71 (2021), issue 4, pp. 947-959
• Xu, Baogen; Sun, Wanting; Li, Shuchao; Li, Chunhua: On the balanced domination of graphs. (English). Czechoslovak Mathematical Journal, vol. 71 (2021), issue 4, pp. 933-946
• Mohammadi, Mehdi; Maghasedi, Mohammad: A note on the open packing number in graphs. (English). Mathematica Bohemica, vol. 144 (2019), issue 2, pp. 221-224
• Haghparast, Nastaran; Kiani, Dariush: Even factor of bridgeless graphs containing two specified edges. (English). Czechoslovak Mathematical Journal, vol. 68 (2018), issue 4, pp. 1105-1114
• Chen, Fuyuan: Order of the smallest counterexample to Gallai's conjecture. (English). Czechoslovak Mathematical Journal, vol. 68 (2018), issue 2, pp. 341-369
• Chen, Fuyuan: Nonempty intersection of longest paths in a graph with a small matching number. (English). Czechoslovak Mathematical Journal, vol. 65 (2015), issue 2, pp. 545-553
• Cichacz, Sylwia; Dib, Soleh; Froncek, Dalibor: Decomposition of complete graphs into $(0,2)$-prisms. (English). Czechoslovak Mathematical Journal, vol. 64 (2014), issue 1, pp. 37-43
• Yin, Jian-Hua: A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially $S_{r,s}$-graphic. (English). Czechoslovak Mathematical Journal, vol. 62 (2012), issue 3, pp. 863-867
• Gera, Ralucca; Okamoto, Futaba; Rasmussen, Craig; Zhang, Ping: Set colorings in perfect graphs. (English). Mathematica Bohemica, vol. 136 (2011), issue 1, pp. 61-68
• Che, Zhongyuan: Existence of perfect matchings in a plane bipartite graph. (English). Czechoslovak Mathematical Journal, vol. 60 (2010), issue 2, pp. 489-494
• Lee, Hung-Chih; Lin, Chiang: Balanced path decomposition of $\lambda K_{n,n}$ and $\lambda K^*_{n,n}$. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 4, pp. 989-997
• Cichacz, Sylwia; Horňák, Mirko: Decomposition of bipartite graphs into closed trails. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 1, pp. 129-144
• Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre: A note on perfect matchings in uniform hypergraphs with large minimum collective degree. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 49 (2008), issue 4, pp. 633-636
• Billington, Elizabeth J.; Cavenagh, Nicholas J.: Decomposing complete tripartite graphs into closed trails of arbitrary lengths. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 2, pp. 523-551
• Klinkenberg, Sabine; Volkmann, Lutz: On the order of certain close to regular graphs without a matching of given size. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 3, pp. 907-918
• Lin, Chiang; Shyu, Tay-Woei: Star number and star arboricity of a complete multigraph. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 961-967
• Escuadro, Henry; Zhang, Ping: On detectable colorings of graphs. (English). Mathematica Bohemica, vol. 130 (2005), issue 4, pp. 427-445
• Volkmann, Lutz: On perfect and unique maximum independent sets in graphs. (English). Mathematica Bohemica, vol. 129 (2004), issue 3, pp. 273-282
• Horňák, Mirko; Woźniak, Mariusz: Decomposition of complete bipartite even graphs into closed trails. (English). Czechoslovak Mathematical Journal, vol. 53 (2003), issue 1, pp. 127-134
• Hartnell, Bert L.; Rall, Douglas F.: Connected domatic number in planar graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 1, pp. 173-179
• Žerovnik, Janez: On recognition of strong graph bundles. (English). Mathematica Slovaca, vol. 50 (2000), issue 3, pp. 289-301
• Harary, Frank; Haynes, Teresa W.: The $k$-tuple domatic number of a graph. (English). Mathematica Slovaca, vol. 48 (1998), issue 2, pp. 161-166
• Fu, Hung-Lin; Škoviera, Martin; Tsai, Ming-Chun: The maximum genus, matchings and the cycle space of a graph. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 2, pp. 329-339
• Limaye, Nirmala B.; Sarvate, Dinesh G.: On $r$-extendability of the hypercube $Q\sb n$. (English). Mathematica Bohemica, vol. 122 (1997), issue 3, pp. 249-255
• Caro, Yair; Rojas, Juan; Ruiz, Sergio: A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs. (English). Czechoslovak Mathematical Journal, vol. 46 (1996), issue 3, pp. 413-419
• Limaye, N. B.; Rao, Mulupuri Shanthi C.: On $2$-extendability of generalized Petersen graphs. (English). Mathematica Bohemica, vol. 121 (1996), issue 1, pp. 77-81
• 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
• Chartrand, Gary; Harary, Frank; Hossain, Moazzem; Schultz, Kelly: Exact $2$-step domination in graphs. (English). Mathematica Bohemica, vol. 120 (1995), issue 2, pp. 125-134
• Wisztová, Elena: Hamiltonian connectedness and a matching in powers of connected graphs. (English). Mathematica Bohemica, vol. 120 (1995), issue 3, pp. 305-317
• 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
• Knor, Martin: Note on linear arboricity. (English). Mathematica Slovaca, vol. 44 (1994), issue 1, pp. 117-122
• Nebeský, Ladislav: A matching and a Hamiltonian cycle of the fourth power of a connected graph. (English). Mathematica Bohemica, vol. 118 (1993), issue 1, pp. 43-52
• Zelinka, Bohdan: Semidomatic and total semidomatic numbers of directed graphs. (English). Mathematica Bohemica, vol. 117 (1992), issue 1, pp. 1-8
• Puš, Vladimír: Combinatorial properties of products of graphs. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 2, pp. 269-277
• Zelinka, Bohdan: Domination in cubes. (English). Mathematica Slovaca, vol. 41 (1991), issue 1, pp. 17-19
• Zelinka, Bohdan: Edge-domatic numbers of cacti. (English). Mathematica Bohemica, vol. 116 (1991), issue 1, pp. 91-95
• Lonc, Zbigniew; Ryjáček, Zdeněk: Factors of claw-free graphs. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 1, pp. 120-130
• Zelinka, Bohdan: Total edge-domatic number of a graph. (English). Mathematica Bohemica, vol. 116 (1991), issue 1, pp. 96-100
• Wisztová, Elena: Existence of $n$-factors in powers of connected graphs. (English). Časopis pro pěstování matematiky, vol. 115 (1990), issue 1, pp. 9-17
• Hrnčiar, Pavel: On decompositions of complete graphs into three factors with given diameters. (English). Czechoslovak Mathematical Journal, vol. 40 (1990), issue 3, pp. 388-396
• Puš, Vladimír: Algebraic and combinatorial properties of products [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 200
• 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
• Zelinka, Bohdan: Complementarily domatic number of a graph. (English). Mathematica Slovaca, vol. 38 (1988), issue 1, pp. 27-32
• Klenovčan, Pavel: Direct product decompositions of $g$-digraphs. (English). Mathematica Slovaca, vol. 38 (1988), issue 3, pp. 215-220
• Bulitko, V. K.; Ninčák, Jan: Групповые раскраски полных двудольных графов и оценки чисел Хегквиста. (Russian) [Group colorings of complete bipartite graphs and bounds for Häggkvist numbers]. Mathematica Slovaca, vol. 38 (1988), issue 1, pp. 11-17
• Híc, Pavol; Palumbíny, Daniel: Isomorphic factorisations of complete graphs into factors with a given diameter. (English). Mathematica Slovaca, vol. 37 (1987), issue 3, pp. 247-254
• Colbourn, Charles J.: Leaves, excesses and neighborhoods. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 28 (1987), issue 2, pp. 41-47
• Guldan, Filip: On a problem of linear arboricity. (English). Časopis pro pěstování matematiky, vol. 112 (1987), issue 4, pp. 395-400
• Fink, John Frederick; Ruiz, Sergio: Every graph is an induced isopart of a circulant. (English). Czechoslovak Mathematical Journal, vol. 36 (1986), issue 2, pp. 172-176
• Guldan, Filip: The linear arboricity of $10$-regular graphs. (English). Mathematica Slovaca, vol. 36 (1986), issue 3, pp. 225-228
• Truszczyński, Mirosław: Linear arboricity of graphs. (English). Mathematica Slovaca, vol. 36 (1986), issue 2, pp. 105-108
• Tomová, Eliška: On the decomposition of complete directed graphs into factors with given radii. (English). Mathematica Slovaca, vol. 36 (1986), issue 2, pp. 211-214
• Davitt, Richard M.; Fink, John Frederick; Jacobson, Michael S.: On isopart parameters of complete bipartite graphs and $n$-cubes. (English). Mathematica Slovaca, vol. 35 (1985), issue 4, pp. 409-415
• Beka, Ján: On the tripartite conjecture. (English). Mathematica Slovaca, vol. 35 (1985), issue 3, pp. 239-241
• Tomová, Eliška: Decomposition of complete bipartite graphs into factors with given diameters and radii. (English). Mathematica Slovaca, vol. 34 (1984), issue 3, pp. 249-253
• Nebeský, Ladislav: Edge-disjoint 1-factors in powers of connected graphs. (English). Czechoslovak Mathematical Journal, vol. 34 (1984), issue 4, pp. 499-505
• Olejník, František: On total matching numbers and total covering numbers for $k$-uniform hypergraphs. (English). Mathematica Slovaca, vol. 34 (1984), issue 3, pp. 319-328
• Nebeský, Ladislav: Upper embeddable factorizations of graphs. (English). Czechoslovak Mathematical Journal, vol. 34 (1984), issue 3, pp. 432-438
• Jezný, Samuel; Trenkler, Marián: Characterization of magic graphs. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 3, pp. 435-438
• Zelinka, Bohdan: Domatic number and degrees of vertices of a graph. (English). Mathematica Slovaca, vol. 33 (1983), issue 2, pp. 145-147
• Zelinka, Bohdan: Homomorphisms of infinite bipartite graphs onto complete bipartite graphs. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 4, pp. 545-547
• Plesník, Ján: Complexity of decomposing graphs into factors with given diameters or radii. (English). Mathematica Slovaca, vol. 32 (1982), issue 4, pp. 379-388
• Zelinka, Bohdan: Domatic numbers of cube graphs. (English). Mathematica Slovaca, vol. 32 (1982), issue 2, pp. 117-119
• Tomasta, Pavel: Note on linear arboricity. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 239-242
• Ajtai, M.; Komlos, J.; Rödl, Vojtěch; Szemeredi, E.: On coverings of random graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 1, pp. 193-198
• 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
• Bell, Murray G.: The space of complete subgraphs of a graph. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 3, pp. 525-536
• Tomasta, Pavel; Zelinka, Bohdan: Decomposition of a complete equipartite graph into isomorphic subgraphs. (English). Mathematica Slovaca, vol. 31 (1981), issue 2, pp. 165-169
• Faudree, R. J.; Rousseau, C. C.; Schelp, Richard H.; Schuster, Seymour: Embedding graphs in their complements. (English). Czechoslovak Mathematical Journal, vol. 31 (1981), issue 1, pp. 53-62
• Nebeský, Ladislav: On $1$-factors in the cube of a graph. (English). Časopis pro pěstování matematiky, vol. 106 (1981), issue 3, pp. 226-230
• Zelinka, Bohdan: On domatic numbers of graphs. (English). Mathematica Slovaca, vol. 31 (1981), issue 1, pp. 91-95
• Lehel, J.: On hypergraph coverings. (English). In: Frolík, Zdeněk (ed.): Abstracta. 9th Winter School on Abstract Analysis. Czechoslovak Academy of Sciences, Praha, 1981. pp. 103-108
• 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
• Nebeský, Ladislav; Wisztová, Elena: Regular factors in powers of connected graphs. (English). Časopis pro pěstování matematiky, vol. 106 (1981), issue 1, pp. 52-59
• Zelinka, Bohdan: Some remarks on domatic numbers of graphs. (English). Časopis pro pěstování matematiky, vol. 106 (1981), issue 4, pp. 373-375
• Plesník, Ján: Coloring of graphs by partitioning. (English). Mathematica Slovaca, vol. 30 (1980), issue 2, pp. 121-126
• Akiyama, Jin; Exoo, Geoffrey; Harary, Frank: Covering and packing in graphs. III: Cyclic and acyclic invariants. (English). Mathematica Slovaca, vol. 30 (1980), issue 4, pp. 405-417
• Dörfler, Willibald; Harary, Frank; Malle, Günther: Covers of digraphs. (English). Mathematica Slovaca, vol. 30 (1980), issue 3, pp. 269-280
• Znám, Štefan: Decomposition of complete graphs into factors of diameter two. (English). Mathematica Slovaca, vol. 30 (1980), issue 4, pp. 373-378
• Poljak, Svatopluk; Rödl, Vojtěch: Orthogonal partitions and covering of graphs. (English). Czechoslovak Mathematical Journal, vol. 30 (1980), issue 3, pp. 475,476-485
• Foregger, Marsha F.; Foregger, Thomas H.: The tree-covering number of a graph. (English). Czechoslovak Mathematical Journal, vol. 30 (1980), issue 4, pp. 633-639
• Nebeský, Ladislav: On 2-factors in squares of graphs. (English). Czechoslovak Mathematical Journal, vol. 29 (1979), issue 4, pp. 588-594
• 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
• Znám, Štefan: Decomposition of the Complete Directed Graph into Two Factors with Given Diameters. (English). Matematický časopis, vol. 20 (1970), issue 4, pp. 254-256
• Tomová, Eliška: On the Decomposition of the Complete Directed Graph into Factors with Given Diameters. (English). Matematický časopis, vol. 20 (1970), issue 4, pp. 257-261