Other formats:
BibTeX
LaTeX
RIS
@article{792455, author = {Hliněný, Petr and Whittle, Geoff}, article_number = {4}, keywords = {graph; matroid; tree-width; branch-width}, language = {eng}, issn = {0195-6698}, journal = {European Journal of Combinatorics}, title = {Addendum to Matroid Tree-Width}, url = {http://dx.doi.org/10.1016/j.ejc.2008.09.028}, volume = {30}, year = {2009} }
TY - JOUR ID - 792455 AU - Hliněný, Petr - Whittle, Geoff PY - 2009 TI - Addendum to Matroid Tree-Width JF - European Journal of Combinatorics VL - 30 IS - 4 SP - 1036 EP - 1036 PB - Elsevier SN - 01956698 KW - graph KW - matroid KW - tree-width KW - branch-width UR - http://dx.doi.org/10.1016/j.ejc.2008.09.028 N2 - Hlin{\v e}n{\'y} and Whittle have shown that the traditional tree-width notion of a graph can be defined without an explicit reference to vertices, and that it can be naturally extended to all matroids. Unfortunately their original paper Matroid tree{-}width, European J.~Combin.~27 (2006), 1117--1128, as pointed out by Isolde Adler in 2007, contained some incorrect arguments. It is the purpose of this addendum to correct the affected proofs. (All the theorems and results of the original paper remain valid.) ER -
HLINĚNÝ, Petr and Geoff WHITTLE. Addendum to Matroid Tree-Width. \textit{European Journal of Combinatorics}. Elsevier, 2009, vol.~30, No~4, p.~1036-1044. ISSN~0195-6698.
|