• DML-CZ Home

05C05 Trees (103 articles)

• Melichar, Bořivoj; Janoušek, Jan; Flouri, Tomas: Arbology: Trees and pushdown automata. (English). Kybernetika, vol. 48 (2012), issue 3, pp. 402-428
• Wei, Yangjiang; Nan, Jizhu; Tang, Gaohua: Structure of cubic mapping graphs for the ring of Gaussian integers modulo $n$. (English). Czechoslovak Mathematical Journal, vol. 62 (2012), issue 2, pp. 527-539
• Janoušek, Jan; Melichar, Bořivoj; Poliak, Martin: Tree compression pushdown automaton. (English). Kybernetika, vol. 48 (2012), issue 3, pp. 429-452
• Wei, Yangjiang; Nan, Jizhu; Tang, Gaohua: The cubic mapping graph for the ring of Gaussian integers modulo $n$. (English). Czechoslovak Mathematical Journal, vol. 61 (2011), issue 4, pp. 1023-1036
• Borowiecki, Mieczysław; Borowiecki, Piotr; Sidorowicz, Elżbieta; Skupień, Zdzisław: On extremal sizes of locally $k$-tree graphs. (English). Czechoslovak Mathematical Journal, vol. 60 (2010), issue 2, pp. 571-587
• Stalder, Shubhangi; Eroh, Linda; Koker, John; Moghadam, Hosien S.; Winters, Steven J.: Classifying trees with edge-deleted central appendage number 2. (English). Mathematica Bohemica, vol. 134 (2009), issue 1, pp. 99-110
• Lin, Chiang; Shang, Jen-Ling: Statuses and branch-weights of weighted trees. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 4, pp. 1019-1025
• Lemańska, Magdalena; Raczek, Joanna: Weakly connected domination stable trees. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 1, pp. 95-100
• Karami, H.; Sheikholeslami, S. M.; Khodkar, Abdollah: Lower bounds on signed edge total domination numbers in graphs. (English). Czechoslovak Mathematical Journal, vol. 58 (2008), issue 3, pp. 595-603
• Che, Zhongyuan: On $k$-pairable graphs from trees. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 1, pp. 377-386
• Flaška, Václav; Jančařík, Antonín; Kala, Vítězslav; Kepka, Tomáš: Trees in commtative nil-semigroups of index two. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 48 (2007), issue 1, pp. 81-101
• Chen, Xue-Gang: Vertices contained in all minimum paired-dominating sets of a tree. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 1, pp. 407-417
• Raczek, Joanna; Lemańska, Magdalena; Cyman, Joanna: Lower bound on the distance $k$-domination number of a tree. (English). Mathematica Slovaca, vol. 56 (2006), issue 2, pp. 235-243
• Nebeský, Ladislav: Signpost systems and spanning trees of graphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 885-893
• Berežný, Štefan; Lacko, Vladimír: The color-balanced spanning tree problem. (English). Kybernetika, vol. 41 (2005), issue 4, pp. [539]-546
• Dulio, Paolo; Pannone, Virgilio: The converse of Kelly’s lemma and control-classes in graph reconstruction. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 44 (2005), issue 1, pp. 25-38
• Zelinka, Bohdan: A remark on branch weights in countable trees. (English). Mathematica Bohemica, vol. 129 (2004), issue 1, pp. 29-31
• Zelinka, Bohdan: Signed 2-domination in caterpillars. (English). Mathematica Bohemica, vol. 129 (2004), issue 4, pp. 393-398
• Mareš, Martin: Two linear time algorithms for MST on minor closed graph classes. (English). Archivum Mathematicum, vol. 40 (2004), issue 3, pp. 315-320
• Zelinka, Bohdan: Algebraic approach to locally finite trees with one end. (English). Mathematica Bohemica, vol. 128 (2003), issue 1, pp. 37-44
• Zelinka, Bohdan: Infinite paths in locally finite graphs and in their spanning trees. (English). Mathematica Bohemica, vol. 128 (2003), issue 1, pp. 71-76
• Zelinka, Bohdan: The 3-path-step operator on trees and unicyclic graphs. (English). Mathematica Bohemica, vol. 127 (2002), issue 1, pp. 33-40
• Zelinka, Bohdan: On signed edge domination numbers of trees. (English). Mathematica Bohemica, vol. 127 (2002), issue 1, pp. 49-55
• Polat, Norbert: End-faithful spanning trees of countable graphs with prescribed sets of rays. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 1, pp. 45-53
• Polat, Norbert: Multi-faithful spanning trees of infinite graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 3, pp. 477-492
• Nešetřil, Jaroslav; Milková, Eva; Nešetřilová, Helena Otakar Borůvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history (English). Discrete Math. 233 (2001), no. 1-3, 3–36
• Hell, Pavol; Nešetřil, J.; Raspaud, A.; Sopena, E.: Three-and-more set theorems. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 41 (2000), issue 4, pp. 793-801
• Nebeský, Ladislav: A tree as a finite nonempty set with a binary operation. (English). Mathematica Bohemica, vol. 125 (2000), issue 4, pp. 455-458
• Kirkland, Steve: Constructions for type I trees with nonisomorphic Perron branches. (English). Czechoslovak Mathematical Journal, vol. 49 (1999), issue 3, pp. 617-632
• Škoviera, Martin: On the minimum number of components in a cotree of a graph. (English). Mathematica Slovaca, vol. 49 (1999), issue 2, pp. 129-135
• Híc, Pavol; Nedela, Roman: Balanced integral trees. (English). Mathematica Slovaca, vol. 48 (1998), issue 5, pp. 429-445
• Nešetřil, Jaroslav: A few remarks on the history of MST-problem. (English). Archivum Mathematicum, vol. 33 (1997), issue 1, pp. 15-22
• Nešetřil, Jaroslav A few remarks on the history of MST-problem (English). Archivum Mathematicum 33, 1-2, 1997, 15-22
• Kruskal, Joseph B. A reminescence about shortest spanning subtrees (English). Archivum Mathematicum 33, 1-2, 1997, 13-14
• Kruskal, Joseph B.: A reminiscence about shortest spanning subtrees. (English). Archivum Mathematicum, vol. 33 (1997), issue 1, pp. 13-14
• Zelinka, Bohdan: Extended trees of graphs. (English). Mathematica Bohemica, vol. 119 (1994), issue 3, pp. 239-244
• Knor, Martin: Note on linear arboricity. (English). Mathematica Slovaca, vol. 44 (1994), issue 1, pp. 117-122
• Zelinka, Bohdan: A modification of the median of a tree. (English). Mathematica Bohemica, vol. 118 (1993), issue 2, pp. 195-200
• Laflamme, Claude: Partitions of $k$-branching trees and the reaping number of Boolean algebras. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 34 (1993), issue 2, pp. 397-399
• Zelinka, Bohdan: Edge shift distance between trees. (English). Archivum Mathematicum, vol. 28 (1992), issue 1, pp. 5-9
• Zelinka, Bohdan: Equivalences between isomorphism classes on infinite graphs. (English). Mathematica Bohemica, vol. 117 (1992), issue 2, pp. 151-155
• Škoviera, Martin: Spanning subgraphs of embedded graphs. (English). Czechoslovak Mathematical Journal, vol. 42 (1992), issue 2, pp. 235-239
• Zelinka, Bohdan: Distances between rooted trees. (English). Mathematica Bohemica, vol. 116 (1991), issue 1, pp. 101-107
• Matoušek, Jiří; Loebl, Martin: Hercules versus Hidden Hydra Helper. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 32 (1991), issue 4, pp. 731-741
• Polat, Norbert: Spanning trees of infinite graphs. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 1, pp. 52-60
• Nýdl, V.: A note on reconstructing of finite trees from small subtrees. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 31 (1990), issue 2, pp. 71-74
• Zelinka, Bohdan: Spanning trees of locally finite graphs. (English). Czechoslovak Mathematical Journal, vol. 39 (1989), issue 2, pp. 193-197
• Nebeský, Ladislav: Embedding $m$-quasistars into $n$-cubes. (English). Czechoslovak Mathematical Journal, vol. 38 (1988), issue 4, pp. 705-712
• Loebl, Martin: Hercules and Hydra. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 1, pp. 85-95
• Lisoněk, Petr: Heuristic search algorithms on directed trees. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 27 (1988), issue 1, pp. 347-354
• Zelinka, Bohdan: Partitionability of trees. (English). Czechoslovak Mathematical Journal, vol. 38 (1988), issue 4, pp. 677-681
• Grone, Robert; Merris, Russell: Algebraic connectivity of trees. (English). Czechoslovak Mathematical Journal, vol. 37 (1987), issue 4, pp. 660-670
• Kučera, Luděk; Rödl, Vojtěch: Large trees in random graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), issue 1, pp. 7-14
• Charatonik, J. J.; Miklos, Stanisław; Omiljanowski, Krzysztof: Locally one-to-one mappings on graphs. (English). Czechoslovak Mathematical Journal, vol. 37 (1987), issue 3, pp. 343-350
• Círulis, Jánis: Betweenness spaces and tree algebras. (English). Časopis pro pěstování matematiky, vol. 111 (1986), issue 4, pp. 340-344
• Alles, Peter: Dimension of amalgamated graphs and trees. (English). Czechoslovak Mathematical Journal, vol. 36 (1986), issue 3, pp. 393-416
• 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
• Loebl, Martin: Hercules and Hydra, a game on rooted finite trees. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 26 (1985), issue 2, pp. 259-267
• Nebeský, Ladislav: On quasistars in $n$-cubes. (English). Časopis pro pěstování matematiky, vol. 109 (1984), issue 2, pp. 153-156
• Blažková, Růžena; Chvalina, Jan: Regularity and transitivity of local-automorphism semigroups of locally finite forests. (English). Archivum Mathematicum, vol. 20 (1984), issue 4, pp. 183-194
• Zelinka, Bohdan: A distance between isomorphism classes of trees. (English). Czechoslovak Mathematical Journal, vol. 33 (1983), issue 1, pp. 126-130
• McMorris, F. R.; Shier, Douglas R.: Representing chordal graphs on $K_{1,n}$. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 24 (1983), issue 3, pp. 489-494
• Říha, S.; Sekanina, Milan: Squares of triangular cacti. (English). Archivum Mathematicum, vol. 19 (1983), issue 3, pp. 153-160
• Chvalina, Jan; Chvalinová, Ludmila: Transitively acting monoids of local automorphisms of locally finite trees. (English). Archivum Mathematicum, vol. 19 (1983), issue 2, pp. 71-82
• Zelinka, Bohdan: Infinite tree algebras. (English). Časopis pro pěstování matematiky, vol. 107 (1982), issue 1, pp. 59-68
• Merris, Russell: The Laplacian permanental polynomial for trees. (English). Czechoslovak Mathematical Journal, vol. 32 (1982), issue 3, pp. 397-403
• Tomasta, Pavel: Note on linear arboricity. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 239-242
• Karoński, Michał; Palka, Zbigniew: Addendum and erratum to the paper "On the size of a maximal induced tree in a random graph". (English). Mathematica Slovaca, vol. 31 (1981), issue 1, pp. 107-108
• Plesník, Ján: A bound for the Steiner tree problem in graphs. (English). Mathematica Slovaca, vol. 31 (1981), issue 2, pp. 155-163
• Zelinka, Bohdan: Bases of classes of trees closed under subdivisions. (English). Mathematica Slovaca, vol. 30 (1980), issue 1, pp. 61-64
• Zelinka, Bohdan: Join graphs of trees. (English). Czechoslovak Mathematical Journal, vol. 30 (1980), issue 2, pp. 332-335
• Karoński, Michał; Palka, Zbigniew: On the size of a maximal induced tree in a random graph. (English). Mathematica Slovaca, vol. 30 (1980), issue 2, pp. 151-155
• Gavalec, Martin; Vojtáš, Peter: Ramsey-type theorems. (English). In: Frolík, Z. (ed.): Abstracta. 8th Winter School on Abstract Analysis. Czechoslovak Academy of Sciences, Praha, 1980. pp. 79-81
• Gavalec, Martin; Vojtáš, Peter: Remarks to a modification of Ramsey-type theorems. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 4, pp. 727-738
• Zelinka, Bohdan: Subarborians. (English). Czechoslovak Mathematical Journal, vol. 30 (1980), issue 2, pp. 336-340
• 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
• Sedláček, Jiří: Ještě o kostrách souvislých grafů. (Czech) [More on spanning trees of connected graphs]. Časopis pro pěstování matematiky, vol. 104 (1979), issue 1, pp. 75-85
• Sysło, Maciej M.: A characterization of hypergraphs generated by arborescences. (English). Kybernetika, vol. 15 (1979), issue 6, pp. (403)-407
• Zelinka, Bohdan: Embedding trees into clique-bridge-clique graphs. (English). Časopis pro pěstování matematiky, vol. 104 (1979), issue 4, pp. 353-356
• Zelinka, Bohdan: The number of isomorphism classes of spanning trees of a graph. (English). Mathematica Slovaca, vol. 28 (1978), issue 4, pp. 385-388
• Zelinka, Bohdan: Caterpillars. (English). Časopis pro pěstování matematiky, vol. 102 (1977), issue 2, pp. 179-185
• Zelinka, Bohdan: The lattice of all subtrees of a tree. (English). Mathematica Slovaca, vol. 27 (1977), issue 3, pp. 277-286
• Nieminen, Juhani: Tolerance relations on simple ternary algebras. (English). Archivum Mathematicum, vol. 13 (1977), issue 2, pp. 105-109
• Zelinka, Bohdan: Embedding trees into block graphs. (English). Czechoslovak Mathematical Journal, vol. 26 (1976), issue 2, pp. 273-279
• Nebeský, Ladislav: A generalization of Hamiltonian cycles for trees. (English). Czechoslovak Mathematical Journal, vol. 26 (1976), issue 4, pp. 596-603
• Zelinka, Bohdan: Intersection graphs of trees and tree algebras. (English). Mathematica Slovaca, vol. 26 (1976), issue 4, pp. 343-350
• Müller, Vladimír: Probabilistic reconstruction from subgraphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 17 (1976), issue 4, pp. 709-719
• Haggard, Gary; McWha, Peter: Decomposition of complete graphs into trees. (English). Czechoslovak Mathematical Journal, vol. 25 (1975), issue 1, pp. 31-36
• Sekanina, Milan: Graphs and Betweeness. (English). Matematický časopis, vol. 25 (1975), issue 1, pp. 41-47
• Nebeský, Ladislav: On tree-complete graphs. (English). Časopis pro pěstování matematiky, vol. 100 (1975), issue 4, pp. 334-338
• Zelinka, Bohdan: Tolerances and congruences on tree algebras. (English). Czechoslovak Mathematical Journal, vol. 25 (1975), issue 4, pp. 634-637
• Nebeský, Ladislav: On cubes and dichotomic trees. (English). Časopis pro pěstování matematiky, vol. 99 (1974), issue 2, pp. 164-167
• Sedláček, Jiří: The Reconstruction of a Connected Graph from its Spanning Trees. (English). Matematický časopis, vol. 24 (1974), issue 4, pp. 307-314
• Nebeský, Ladislav: Reconstruction of a tree from certain maximal proper subtrees. (English). Časopis pro pěstování matematiky, vol. 99 (1974), issue 1, pp. 44-48
• Zelinka, Bohdan: Determining the maximal degree of a tree given by its distance matrix. (English). Kybernetika, vol. 9 (1973), issue 5, pp. (361)-364
• Havel, Ivan; Liebl, Petr: Embedding the polytomic tree into the $n$-cube. (English). Časopis pro pěstování matematiky, vol. 98 (1973), issue 3, pp. 307-314
• Zelinka, Bohdan: Finding a spanning tree of a graph with maximal number of terminal vertices. (English). Kybernetika, vol. 9 (1973), issue 5, pp. (357)-360
• Nebeský, Ladislav: On the minimum number of vertices and edges in a graph with a given number of spanning trees. (English). Časopis pro pěstování matematiky, vol. 98 (1973), issue 1, pp. 95-97
• Havel, Ivan; Liebl, Petr: O vnoření dichotomického stromu do krychle. (Czech) [Embedding the dichotomic tree into the $n$-cube]. Časopis pro pěstování matematiky, vol. 97 (1972), issue 2, pp. 201-205
• Zelinka, Bohdan: Embedding infinite trees into a cube of infinite dimension. (English). Časopis pro pěstování matematiky, vol. 97 (1972), issue 4, pp. 386-388
• Nešetřil, Jaroslav: On reconstructing of infinite forests. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 13 (1972), issue 3, pp. 503-510
• Zelinka, Bohdan: Medians and peripherians of trees. (English). Archivum Mathematicum, vol. 4 (1968), issue 2, pp. 87-95