• DML-CZ Home

05C60 Isomorphism problems (reconstruction conjecture, etc.) (19 articles)

• Bošnjak, Ivica; Madarász, Rozália: Some globally determined classes of graphs. (English). Czechoslovak Mathematical Journal, vol. 68 (2018), issue 3, pp. 633-646
• Kabyl, Kamal; Berrachedi, Abdelhafid; Sopena, Éric: A note on the cubical dimension of new classes of binary trees. (English). Czechoslovak Mathematical Journal, vol. 65 (2015), issue 1, pp. 151-160
• Che, Zhongyuan: On $k$-pairable graphs from trees. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 1, pp. 377-386
• 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
• Ratanaprasert, Chawewan: Graph isomorphism of ordered sets. (English). Mathematica Slovaca, vol. 52 (2002), issue 5, pp. 491-499
• Pióro, Konrad: On some non-obvious connections between graphs and unary partial algebras. (English). Czechoslovak Mathematical Journal, vol. 50 (2000), issue 2, pp. 295-320
• Caro, Yair: On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell. (English). Czechoslovak Mathematical Journal, vol. 44 (1994), issue 4, pp. 623-629
• Zelinka, Bohdan: Distances between partially ordered sets. (English). Mathematica Bohemica, vol. 118 (1993), issue 2, pp. 167-170
• Zelinka, Bohdan: Equivalences between isomorphism classes on infinite graphs. (English). Mathematica Bohemica, vol. 117 (1992), issue 2, pp. 151-155
• Nedela, Roman: Locally homogeneous graphs with dense links at vertices. (English). Czechoslovak Mathematical Journal, vol. 42 (1992), issue 3, pp. 515-517
• Mândrescu, Eugen: Strongly perfect products of graphs. (English). Czechoslovak Mathematical Journal, vol. 41 (1991), issue 2, pp. 368-372
• Šoltés, Ľ.: Neighborhoods in line graphs. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 31 (1990), issue 2, pp. 105
• 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
• Nýdl, Václav: Reconstructing equivalences. (English). In: Frolík, Z., Souček, V. and Vinárek, J. (eds.): Proceedings of the 13th Winter School on Abstract Analysis. Section of Topology. Circolo Matematico di Palermo, Palermo, 1985. pp. [71]-75
• Nýdl, Václav: Some results concerning reconstruction conjecture. (English). In: Frolík, Z. (ed.): Proceedings of the 12th Winter School on Abstract Analysis. Section of Topology. Circolo Matematico di Palermo, Palermo, 1984. pp. [243]-246
• Širáň, Jozef: Reconstruction of graphs with special degree-sequences. (English). Mathematica Slovaca, vol. 32 (1982), issue 4, pp. 403-404
• Nýdl, Václav: Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 22 (1981), issue 2, pp. 281-287
• Müller, V.: On Ulam's hypothesis. (English). In: Frolík, Z. (ed.): Abstracta. 4th Winter School on Abstract Analysis. Czechoslovak Academy of Sciences, Praha, 1976. pp. 29
• Křivka, Pavel: On homomorphism perfect graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 12 (1971), issue 3, pp. 619-626