scientific article; zbMATH DE number 5990058

MaRDI QIDQ3104376zbMATH OpenFDO

Authors Hiu Fai Law, Mikhail Ostrovskii

Publication date 19 December 2011

zbMATH Keywords

Cartesian products of pathscomplete graphs

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cited in

(6)

• Sparsest cuts and concurrent flows in product graphs.
• Spanning tree congestion of rook's graphs
• Spanning tree congestion of planar graphs
• A Survey on Spanning Tree Congestion
• Spanning tree congestion of k-outerplanar graphs
• Hardness results and an exact exponential algorithm for the spanning tree congestion problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104376)