Testing Bandwidth k for k-Connected Graphs

DOI10.1137/S0895480199351148zbMATH Open1029.05135OpenAlexW1975578294MaRDI QIDQ4443087

Sven Guttmann, Konrad Engel

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480199351148

zbMATH Keywords

bandwidthlinear-time algorithm\(k\)-connected graphlinear layoutbandwidth-\(k\) graphstart sequence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Testing \(k\)-edge-connectivity of digraphs

This page was built for publication: Testing Bandwidth k for k-Connected Graphs

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