Decomposing infinite 2-connected graphs into 3-connected components.
Richter, R. Bruce (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Topological spaces admitting a unique fractal structure”
Decomposing infinite 2-connected graphs into 3-connected components.
On two graph-theoretical problems from the conference at Nová Ves u Branžeže
Bohdan Zelinka (1981)
Časopis pro pěstování matematiky
Similarity:
An ordering of some metrics defined on the space of graphs
Mark Johnson (1987)
Czechoslovak Mathematical Journal
Similarity:
Topological circles and Euler tours in locally finite graphs.
Georgakopoulos, Agelos (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Even bonds of prescribed directed parity.
Hartmann, Sven, Little, C.H.C. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Local expansions on graphs
J. Chartonik, S. Miklos (1981)
Fundamenta Mathematicae
Similarity:
Rainbow Connection In Sparse Graphs
Arnfried Kemnitz, Jakub Przybyło, Ingo Schiermeyer, Mariusz Woźniak (2013)
Discussiones Mathematicae Graph Theory
Similarity:
An edge-coloured connected graph G = (V,E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours. The rainbow connection number of G, denoted by rc(G), is the minimum number of colours such that G is rainbow-connected. In this paper we prove that rc(G) ≤ k if |V (G)| = n and for all integers n and k with n − 6 ≤ k ≤ n − 3. We also show that this bound is tight.