Browsing by Author "Fronček, Dalibor"
Now showing items 1-20 of 29
-
2n-cyclic blended labeling of graphs
Fronček, Dalibor; Kovářová, Tereza (Ars Combinatoria. 2007, vol. 83, April, p. 129-144.) -
Almost self-complementary factors of complete bipartite graphs
Fronček, Dalibor (Discrete Mathematics. 1997, vol. 167-168, p. 317-327.) -
Bi-cyclic decompositions of complete graphs into spanning trees
Fronček, Dalibor (Discrete Mathematics. 2007, vol. 307, issues 11-12, p. 1317-1322.) -
Cluttered orderings for the complete graph
Cohen, Myra B.; Colbourn, Charles J.; Fronček, Dalibor (Computing and Combinatorics : 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001. Proceedings. 2001, p. 420-431.) -
Decomposition of complete bipartite graphs into generalized prisms
Cichacz, Sylwia; Fronček, Dalibor; Kovář, Petr (European Journal of Combinatorics. 2013, vol. 34, issue 1, p. 104-110.) -
Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
Fronček, Dalibor (Graphs and Combinatorics. 1996, vol. 12, no. 4, p. 305-320.) -
Decompositions of complete graphs into blown-up cycles C-m[2]
Fronček, Dalibor; Kovář, Petr; Kubesa, Michael (Discrete Mathematics. 2010, vol. 310, issue 5, p. 1003-1015.) -
Decompositions of complete multipartite graphs into disconnected selfcomplementary factors
Fronček, Dalibor (Utilitas Mathematica. 1998, vol. 53, p. 201-216.) -
Disconnected self-complementary factors of almost complete tripartite graphs
Fronček, Dalibor (Utilitas Mathematica. 1999, vol. 56, p. 107–116.) -
Factorizations of complete graphs into caterpillars of diameter 4 and 5
Kubesa, Michael (Disertační práce, 2004) -
Factorizations of complete graphs into caterpillars of diameter 5
Fronček, Dalibor; Kovář, Petr; Kovářová, Tereza; Kubesa, Michael (Discrete Mathematics. 2010, vol. 310, issue 3, p. 537-556.) -
Factorizations of complete graphs into trees with at most four non-leave vertices
Fronček, Dalibor; Kovář, Petr; Kubesa, Michael (Graphs and Combinatorics. 2011, vol. 27, no. 5, p. 621-646.) -
Graphs with near v- and e-neighbourhoods
Fronček, Dalibor (Glasgow Mathematical Journal. 1990, vol. 32, issue 2, p. 197-199.) -
Halving complete 4-partite graphs
Fronček, Dalibor; Sirán, Jozef (Ars Combinatoria. 2000, vol. 55, p. 43-63.) -
Halving transversal designs
Fronček, Dalibor; Meszka, Mariusz (Journal of Combinatorial Designs. 2000, vol. 8, issue 2, p. 83-99.) -
Implementation of Non-Overlapping Domain Deomposition Techniques for FETI Methods.
Kabelíková, Pavla (Disertační práce, 2012) -
Magic labelings of graphs
Kovář, Petr (Disertační práce, 2004) -
Note on a multiple-key multiple-lock security problem
Fronček, Dalibor; Kubesa, Michael (Sborník vědeckých prací Vysoké školy báňské - Technické univerzity Ostrava. Řada informatika a matematika. 2001, roč. 1, č. 1, s. 77-84 : il.) -
On biclique coverings
Bezrukov, Sergei; Fronček, Dalibor; Rosenberg, Steven J.; Kovář, Petr (Discrete Mathematics. 2008, vol. 308, issue 2-3, p. 319-323.) -
On seed graphs with more than two components
Fronček, Dalibor (Discrete Mathematics. 2001, vol. 233, issues 1-3, p. 115-126.)