Constant Congestion Brambles

A bramble in an undirected graph G is a family of connected subgraphs of G such that for every two subgraphs H1 and H2 in the bramble either V (H1) ∩ V (H2) ≠ θ or there is an edge of G with one endpoint in V (H1) and the second endpoint in V (H2). The order of the bramble is the minimum size of a...

Full description

Bibliographic Details
Main Authors: Hatzel, M. (Author), Komosa, P. (Author), Pilipczuk, M. (Author), Sorge, M. (Author)
Format: Article
Language:English
Published: Discrete Mathematics and Theoretical Computer Science 2022
Subjects:
Online Access:View Fulltext in Publisher

Similar Items