Decomposing rooted (k,l)-connected graphs into rooted k-connected parts
Statement
Let G=(V,E) be an undirected graph, and a root node. G is called rooted (k,l)-connected if G-X is -edge-connected for any . Is it true that every rooted (k,l)-connected graph contains l edge-disjoint spanning rooted k-connected subgraphs?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.