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...
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
-
A note on line graphs
by: Dănuţ Marcu
Published: (1997-11-01) -
Bayesian graphical models for computational network biology
by: Yang Ni, et al.
Published: (2018-03-01) -
On transitivity and connectedness of Cayley graphs of gyrogroups
by: Rasimate Maungchang, et al.
Published: (2021-05-01) -
K migrácii a zimným nocoviskám piniek severských (Fringilla montifringilla) na Slovensku On migration and winter roosting sites of bramblings (Fringilla montifringilla) in Slovakia
by: Miroslav FULÍN, et al.
Published: (2017-12-01) -
Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
by: Hebert Perez-Roses
Published: (2014-10-01)