Local properties and upper embeddability of connected multigraphs
Ladislav Nebeský (1993)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Certain cubic multigraphs and their upper embeddability”
Local properties and upper embeddability of connected multigraphs
Decomposing infinite 2-connected graphs into 3-connected components.
Richter, R. Bruce (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-locally connected graphs and their upper embeddability
Ladislav Nebeský (1991)
Czechoslovak Mathematical Journal
Similarity:
Connectivity of the lifts of a greedoid.
Tedford, Steven J. (2007)
The Electronic Journal of Combinatorics [electronic only]
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.