- Full text PDF available (4)
- This year (0)
- Last 5 years (1)
- Last 10 years (2)
The Road Coloring Conjecture is an old and classical conjecture posed in Adler and Weiss (1970); Adler et al. (1977). Let G be a strongly connected digraph with uniform out-degree 2. The Road Coloring Conjecture states that, under a natural (necessary) condition that G is " aperiodic " , the edges of G can be colored red and blue such that " universal… (More)
A shredder in an undirected graph is a set of vertices whose removal results in at least three components. A 3-shredder is a shredder of size three. We present an algorithm that, given a 3-connected graph, finds its 3-shredders in time proportional to the number of vertices and edges, when implemented on a RAM (random access machine).
A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair (A, B) such that A ∪ B = V (G), |A ∩ B| = 3 and no edge has one end in A − B and the other in B − A, one of the induced subgraphs G[A], G[B] has at most four edges. We describe a set of constructions that starting from a weakly 4-connected planar graph G… (More)