Certifying large branch-width

DOI10.1145/1109557.1109646MaRDI QIDQ3581552zbMATH OpenOpenAlexFDO

Authors Sang-Il Oum, Paul Seymour

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109646

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(1)

• Computing with tangles

This page was built for publication: Certifying large branch-width

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