• DML-CZ Home

05C85 Graph algorithms (19 articles)

• Bossong, Ulrike; Schweigert, Dietmar: Minimal paths on ordered graphs. (English). Mathematica Slovaca, vol. 56 (2006), issue 1, pp. 23-31
• Semanišin, G.; Soták, R.: A note on on-line ranking number of graphs. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 2, pp. 591-599
• Berežný, Štefan; Lacko, Vladimír: The color-balanced spanning tree problem. (English). Kybernetika, vol. 41 (2005), issue 4, pp. [539]-546
• Kırlangı, Alpay: Graph operations and neighbor-integrity. (English). Mathematica Bohemica, vol. 129 (2004), issue 3, pp. 245-254
• Mareš, Martin: Two linear time algorithms for MST on minor closed graph classes. (English). Archivum Mathematicum, vol. 40 (2004), issue 3, pp. 315-320
• Balík, Miroslav: Implementation of directed acyclic word graph. (English). Kybernetika, vol. 38 (2002), issue 1, pp. [91]-103
• 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
• Smolíková, Petra: Homomorphism duality for rooted oriented paths. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 41 (2000), issue 3, pp. 631-643
• Žerovnik, Janez: On recognition of strong graph bundles. (English). Mathematica Slovaca, vol. 50 (2000), issue 3, pp. 289-301
• Juvan, Martin; Marinček, Jože; Mohar, Bojan: Elimination of local bridges. (English). Mathematica Slovaca, vol. 47 (1997), issue 1, pp. 85-92
• Cáceres, José; Márquez, Alberto: A linear algorithm to recognize maximal generalized outerplanar graphs. (English). Mathematica Bohemica, vol. 122 (1997), issue 3, pp. 225-230
• 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
• Nešetřil, Jaroslav; Rödl, Vojtěch: More on the complexity of cover graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 36 (1995), issue 2, pp. 269-278
• Jansen, Klaus: Exploiting the structure of conflict graphs in high level synthesis. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 35 (1994), issue 1, pp. 155-167
• Hudec, Oto; Zimmermann, Karel: A service points location problem with Min-Max distance optimality criterion. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 34 (1993), issue 1, pp. 105-112
• Janiga, Ladislav; Koubek, Václav: Minimum cut in directed planar networks. (English). Kybernetika, vol. 28 (1992), issue 1, pp. 37-49
• Kratochvíl, Jan; Nešetřil, Jaroslav: INDEPENDENT SET and CLIQUE problems in intersection-defined classes of graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 31 (1990), issue 1, pp. 85-93
• Kratochvíl, Jan; Matoušek, Jiří: NP-hardness results for intersection graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 4, pp. 761-773
• Ibaraki, Toshihide; Poljak, Svatopluk: Three-linking in Eulerian digraphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 192