On spanning tree congestion of graphs
type: Item
instance of: scholarly article
title: On spanning tree congestion of graphs
zbMATH Open document ID: 1232.05116
author: Kyohei Kozawa
author: Yota Otachi
author: Koichi Yamazaki
published in: Discrete Mathematics
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5644935
zbMATH Keywords: spanning tree congestion
zbMATH Keywords: edge isoperimetric problem
zbMATH Keywords: complete \(k\)-partite graph
zbMATH Keywords: torus
MaRDI profile type: Publication
full work available at URL: j.disc.2008.12.021
OpenAlex ID: W2056879109
cites work: Q4250148
cites work: The congestion of \(n\)-cube layout on a rectangular grid
cites work: On embedding graphs in trees
cites work: Q4291429
cites work: Edge-isoperimetric inequalities in the grid
cites work: The carvingwidth of hypercubes
cites work: The treewidth and pathwidth of hypercubes
cites work: On induced subgraphs of the cube
cites work: Wiener index of trees: Theory and applications
cites work: Multi-Terminal Network Flows
cites work: Very Simple Methods for All Pairs Network Flow Analysis
cites work: On tree congestion of graphs
cites work: Designing multi-commodity flow trees
cites work: Q4870352
cites work: Minimal congestion trees
cites work: Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
cites work: Call routing and the ratcatcher
cites work: A variation on the min cut linear arrangement problem
cites work: On the minimum average distance spanning tree of the hypercube
cites work: Cutwidth I: A linear time fixed parameter algorithm
DOI: 10.1016/J.DISC.2008.12.021
description: scientific article; zbMATH DE number 5644935