Isoperimetric Inequalities and the Width Parameters of Graphs

DOI10.1007/3-540-45071-8_39zbMath1276.05103OpenAlexW1548436865MaRDI QIDQ3082945

C. R. Subramanian, L. Sunil Chandran, Telikepalli Kavitha

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_39

zbMATH Keywords

isoperimetric inequalitiestreewidthpathwidthcarving width

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Decontamination of hypercubes by mobile agents ⋮ Edge-bandwidth of grids and tori

This page was built for publication: Isoperimetric Inequalities and the Width Parameters of Graphs