• DML-CZ Home

05C40 Connectivity (62 articles)

• Mao, Yaping; Melekian, Christopher; Cheng, Eddie: A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs. (English). Czechoslovak Mathematical Journal, vol. 73 (2023), issue 1, pp. 237-244
• Li, Yinkui; Mao, Yaping; Wang, Zhao; Wei, Zongtian: Generalized connectivity of some total graphs. (English). Czechoslovak Mathematical Journal, vol. 71 (2021), issue 3, pp. 623-640
• Atani, S. Ebrahimi; Hesari, S. Dolati Pish; Khoramdel, M.: A graph associated to proper non-small ideals of a commutative ring. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 58 (2017), issue 1, pp. 1-12
• Nikmehr, M. J.; Soleymanzadeh, B.: The prime ideals intersection graph of a ring. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 58 (2017), issue 2, pp. 137-145
• Cioabă, Sebastian M.; Gu, Xiaofeng: Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs. (English). Czechoslovak Mathematical Journal, vol. 66 (2016), issue 3, pp. 913-924
• Sun, Yuefang: Generalized 3-edge-connectivity of Cartesian product graphs. (English). Czechoslovak Mathematical Journal, vol. 65 (2015), issue 1, pp. 107-117
• Argoubi, Hajer; Samet, Bessem; Turinici, Mihai: Fixed point results on a metric space endowed with a finite number of graphs and applications. (English). Czechoslovak Mathematical Journal, vol. 64 (2014), issue 1, pp. 241-250
• Qin, Chengfu; Guo, Xiaofeng; Yang, Weihua: The contractible subgraph of $5$-connected graphs. (English). Czechoslovak Mathematical Journal, vol. 63 (2013), issue 3, pp. 671-677
• Ferrero, Daniela; Menon, Manju K.; Vijayakumar, A.: Containers and wide diameters of $P_3(G)$. (English). Mathematica Bohemica, vol. 137 (2012), issue 4, pp. 383-393
• Yang, Yingqiu; Sun, Liang: Contractible edges in some $k$-connected graphs. (English). Czechoslovak Mathematical Journal, vol. 62 (2012), issue 3, pp. 637-644
• Zhao, Kewen: A simple proof of Whitney's Theorem on connectivity in graphs. (English). Mathematica Bohemica, vol. 136 (2011), issue 1, pp. 25-26
• Emtander, Eric; Mohammadi, Fatemeh; Moradi, Somayeh: Some algebraic properties of hypergraphs. (English). Czechoslovak Mathematical Journal, vol. 61 (2011), issue 3, pp. 577-607
• Stuart, Jeffrey L.: The eavesdropping number of a graph. (English). Czechoslovak Mathematical Journal, vol. 59 (2009), issue 3, pp. 623-636
• Nebeský, Ladislav: On the distance function of a connected graph. (English). Czechoslovak Mathematical Journal, vol. 58 (2008), issue 4, pp. 1101-1106
• Chartrand, Gary; Johns, Garry L.; McKeon, Kathleen A.; Zhang, Ping: Rainbow connection in graphs. (English). Mathematica Bohemica, vol. 133 (2008), issue 1, pp. 85-98
• Volkmann, Lutz; Winzen, Stefan: Cycles with a given number of vertices from each partite set in regular multipartite tournaments. (English). Czechoslovak Mathematical Journal, vol. 56 (2006), issue 3, pp. 827-843
• Samodivkin, Vladmir: Minimal acyclic dominating sets and cut-vertices. (English). Mathematica Bohemica, vol. 130 (2005), issue 1, pp. 81-88
• Nebeský, Ladislav: On signpost systems and connected graphs. (English). Czechoslovak Mathematical Journal, vol. 55 (2005), issue 2, pp. 283-293
• Kırlangıc, Alpay: Graph operations and neighbor-integrity. (English). Mathematica Bohemica, vol. 129 (2004), issue 3, pp. 245-254
• Saenpholphat, Varaporn; Zhang, Ping: On connected resolving decompositions in graphs. (English). Czechoslovak Mathematical Journal, vol. 54 (2004), issue 3, pp. 681-696
• Ayala, R.; Chávez, M. J.; Márquez, A.; Quintero, A.: On the connectivity of skeletons of pseudomanifolds with boundary. (English). Mathematica Bohemica, vol. 127 (2002), issue 3, pp. 375-384
• Hartnell, Bert L.; Rall, Douglas F.: Connected domatic number in planar graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 1, pp. 173-179
• Chartrand, Gary; Jarrett, Elzbieta B.; Saba, Farrokh; Salehi, Ebrahim; Zhang, Ping: $F$-continuous graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 2, pp. 351-361
• Huang, Yuanqiu; Liu, Yanpei: Face size and the maximum genus of a graph. II: Nonsimple graphs. (English). Mathematica Slovaca, vol. 51 (2001), issue 2, pp. 129-140
• Marcu, Dănuţ: A note on the domination number of a graph and its complement. (English). Mathematica Bohemica, vol. 126 (2001), issue 1, pp. 63-65
• Pióro, Konrad: On subalgebra lattices of a finite unary algebra. I. (English). Mathematica Bohemica, vol. 126 (2001), issue 1, pp. 161-170
• Pióro, Konrad: On subalgebra lattices of a finite unary algebra. II. (English). Mathematica Bohemica, vol. 126 (2001), issue 1, pp. 171-181
• Chao, Chong-Yun; Han, Shaocen: On the toughness of cycle permutation graphs. (English). Czechoslovak Mathematical Journal, vol. 51 (2001), issue 2, pp. 239-260
• Kirkland, Stephen J.; Neumann, Michael; Shader, Bryan L.: Bounds on the subdominant eigenvalue involving group inverses with applications to graphs. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 1, pp. 1-20
• Zhang, Fuji; Chen, Zhibo: Interpolation theorem for a continuous function on orientations of a simple graph. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 3, pp. 433-438
• Kirkland, Stephen J.; Neumann, Michael; Shader, Bryan L.: On a bound on algebraic connectivity: the case of equality. (English). Czechoslovak Mathematical Journal, vol. 48 (1998), issue 1, pp. 65-76
• Ivančo, Jaroslav: The Hadwiger number of complements of some graphs. (English). Mathematica Slovaca, vol. 47 (1997), issue 4, pp. 393-403
• Marcu, Dănuţ: Note on a Lovász's result. (English). Mathematica Bohemica, vol. 122 (1997), issue 4, pp. 401-403
• Chao, Chong-Yun; Han, Shao-cen: On the classification and toughness of generalized permutation star-graphs. (English). Czechoslovak Mathematical Journal, vol. 47 (1997), issue 3, pp. 431-452
• Marcu, Dănuţ: On colouring products of graphs. (English). Mathematica Bohemica, vol. 121 (1996), issue 1, pp. 69-71
• Chen, Zhibo: On minimum locally $n$-(arc)-strong digraphs. (English). Czechoslovak Mathematical Journal, vol. 46 (1996), issue 2, pp. 317-323
• Nedela, Roman; Škoviera, Martin: Atoms of cyclic connectivity in cubic graphs. (English). Mathematica Slovaca, vol. 45 (1995), issue 5, pp. 481-499
• Vestergaard, Preben Dahl; Zelinka, Bohdan: Cut-vertices and domination in graphs. (English). Mathematica Bohemica, vol. 120 (1995), issue 2, pp. 135-143
• Nebeský, Ladislav: A characterization of the interval function of a connected graph. (English). Czechoslovak Mathematical Journal, vol. 44 (1994), issue 1, pp. 173-178
• Marcu, Dănuţ: Note on $k$-chromatic graphs. (English). Mathematica Bohemica, vol. 119 (1994), issue 1, pp. 43-48
• Zelinka, Bohdan: Graphs in which each pair of vertices has exactly two common neighbours. (English). Mathematica Bohemica, vol. 118 (1993), issue 2, pp. 163-165
• Nebeský, Ladislav: A matching and a Hamiltonian cycle of the fourth power of a connected graph. (English). Mathematica Bohemica, vol. 118 (1993), issue 1, pp. 43-52
• Marcu, Dănuţ: Note on graphs colouring. (English). Mathematica Bohemica, vol. 117 (1992), issue 2, pp. 157-158
• Jendroľ, Stanislav; Kekeňák, Roman: Longest circuits in triangular and quadrangular $3$-polytopes with two types of edges. (English). Mathematica Slovaca, vol. 40 (1990), issue 4, pp. 341-357
• Trenkler, Marián: On $4$-connected, planar $4$-almost pancyclic graphs. (English). Mathematica Slovaca, vol. 39 (1989), issue 1, pp. 13-20
• Plesník, Ján; Znám, Štefan: On equality of edge-connectivity and minimum degree of a graph. (English). Archivum Mathematicum, vol. 25 (1989), issue 1, pp. 19-25
• Matoušek, Jiří: Few colored cuts or cycles in edge colored graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 2, pp. 227-232
• Ryjáček, Zdeněk; Zelinka, Bohdan: Locally disconnected graphs with large numbers of edges. (English). Mathematica Slovaca, vol. 37 (1987), issue 2, pp. 195-198
• Borowiecki, Mieczysław: Partition numbers, connectivity and Hamiltonicity. (English). Časopis pro pěstování matematiky, vol. 112 (1987), issue 2, pp. 173-176
• Nebeský, Ladislav: On locally quasiconnected graphs and their upper embeddability. (English). Czechoslovak Mathematical Journal, vol. 35 (1985), issue 1, pp. 162-166
• Nebeský, Ladislav: Edge-disjoint 1-factors in powers of connected graphs. (English). Czechoslovak Mathematical Journal, vol. 34 (1984), issue 4, pp. 499-505
• Trnková, Věra: Isomorphisms of products of infinite connected graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 25 (1984), issue 2, pp. 303-317
• Zelinka, Bohdan: Locally tree-like graphs. (English). Časopis pro pěstování matematiky, vol. 108 (1983), issue 3, pp. 230-238
• Horák, Peter: A note on removing a point of a strong digraph. (English). Mathematica Slovaca, vol. 33 (1983), issue 1, pp. 85-86
• Horák, Peter: Digraphs maximal with respect to arc connectivity. (English). Mathematica Slovaca, vol. 32 (1982), issue 3, pp. 243-253
• Horák, Peter: Enumeration of graphs maximal with respect to connectivity. (English). Mathematica Slovaca, vol. 32 (1982), issue 1, pp. 81-84
• Kulkarni, K. H.: Sufficient conditions for edge-locally connected and $n$-connected graphs. (English). Časopis pro pěstování matematiky, vol. 106 (1981), issue 2, pp. 112-116
• Toman, Eduard: О вероятности связности случайного подграфа n-мерного куба. (Russian) [Probability of connectedness of a random subgraph of an $n$-dimensional cube]. Mathematica Slovaca, vol. 30 (1980), issue 3, pp. 251-265
• Horák, Peter: Digraphs maximal with respect to connectivity. (English). Mathematica Slovaca, vol. 29 (1979), issue 1, pp. 87-90
• Nebeský, Ladislav: On pancyclic line graphs. (English). Czechoslovak Mathematical Journal, vol. 28 (1978), issue 4, pp. 650-655
• Zelinka, Bohdan: Alternating connectivity of digraphs. (English). Časopis pro pěstování matematiky, vol. 96 (1971), issue 2, pp. 151-163
• Zelinka, Bohdan: Alternating connectivity of tournaments. (English). Časopis pro pěstování matematiky, vol. 96 (1971), issue 4, pp. 346-352