2023/05/29 by Georgios Kontogeorgiou, Alexandros Leivaditis, Kontogeorgiou, Georgios +7
Computer Science · Mathematics · #Advanced Graph Theory Research #Interconnection Networks and Systems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2305.18069
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph by more than a constant factor. We prove that the branchwidth of connected hypergraphs without bridges and loops that are embeddable in some surface of Euler genus at most g is an (1,g)-self-dual parameter. This is the first proof that branchwidth is an additively self-dual width parameter.