• DML-CZ Home

68R10 Graph theory (30 articles)

• Ma, Li: Porous media equation on locally finite graphs. (English). Archivum Mathematicum, vol. 58 (2022), issue 3, pp. 177-187
• Chappell, Glenn G.; Gimbel, John: On subgraphs without large components. (English). Mathematica Bohemica, vol. 142 (2017), issue 1, pp. 85-111
• Sawkmie, Amplify; Singh, Madan Mohan: On the tree structure of the power digraphs modulo $n$. (English). Czechoslovak Mathematical Journal, vol. 65 (2015), issue 4, pp. 923-945
• Frick, Marietjie; Llano, Bernardo; Zuazua, Rita: Self-diclique circulant digraphs. (English). Mathematica Bohemica, vol. 140 (2015), issue 3, pp. 361-367
• Bhatti, Faqir M.; Das, Kinkar Ch.; Ahmed, Syed A.: On the energy and spectral properties of the he matrix of hexagonal systems. (English). Czechoslovak Mathematical Journal, vol. 63 (2013), issue 1, pp. 47-63
• Malvestuto, Francesco M.: A backward selection procedure for approximating a discrete probability distribution by decomposable models. (English). Kybernetika, vol. 48 (2012), issue 5, pp. 825-844
• Cheilaris, Panagiotis; Specker, Ernst; Zachos, Stathis: Neochromatica. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 51 (2010), issue 3, pp. 469-480
• Che, Zhongyuan: On $k$-pairable graphs from trees. (English). Czechoslovak Mathematical Journal, vol. 57 (2007), issue 1, pp. 377-386
• 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
• Juvan, Martin; Marinček, Jože; Mohar, Bojan: Elimination of local bridges. (English). Mathematica Slovaca, vol. 47 (1997), issue 1, pp. 85-92
• 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
• Zámožík, Jozef; Mišútová, Mária: Finite nondense point set analysis. (English). Applications of Mathematics, vol. 38 (1993), issue 3, pp. 161-168
• Markl, Jaroslav: A graph method for Markov models solving. (English). Acta Mathematica et Informatica Universitatis Ostraviensis, vol. 1 (1993), issue 1, pp. 75-82
• Tuza, Zsolt: Theorem proving through depth-first test. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 33 (1992), issue 2, pp. 135-141
• Šándorová, Ľubica; Trenkler, Marián: On a generalization of perfect $b$-matching. (English). Mathematica Bohemica, vol. 116 (1991), issue 4, pp. 380-384
• 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
• Czyzowicz, Jurek; Pelc, Andrzej; Rival, Ivan: Planar ordered sets of width two. (English). Mathematica Slovaca, vol. 40 (1990), issue 4, pp. 375-388
• 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
• 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
• Křivánek, Mirko: A note on the computational complexity of computing the edge rotation distance between graphs. (English). Časopis pro pěstování matematiky, vol. 113 (1988), issue 1, pp. 52-55
• Matoušek, Jiří; Nešetřil, Jaroslav; Thomas, Robin: On polynomial time decidability of induced-minor-closed classes. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 4, pp. 703-710
• Plesník, Ján: On the interchange heuristic for locating centers and medians in a graph. (English). Mathematica Slovaca, vol. 37 (1987), issue 2, pp. 209-216
• Thomas, Robin: Width compactness theorem and well-quasi-ordering infinite graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 27 (1986), issue 1, pp. 206-208
• Nešetřil, Jaroslav; Poljak, Svatopluk: On the complexity of the subgraph problem. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 26 (1985), issue 2, pp. 415-419
• Plesník, Ján: A bound for the Steiner tree problem in graphs. (English). Mathematica Slovaca, vol. 31 (1981), issue 2, pp. 155-163
• Plesník, Ján: On the computational complexity of centers locating in a graph. (English). Aplikace matematiky, vol. 25 (1980), issue 6, pp. 445-452
• Čulík, Karel: Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers. (English). Aplikace matematiky, vol. 16 (1971), issue 3, pp. 188-202
• Čulík, Karel: A note on complexity of algorithmic nets without cycles. (English). Aplikace matematiky, vol. 16 (1971), issue 4, pp. 297-301