J 2009

Addendum to Matroid Tree-Width

HLINĚNÝ, Petr and Geoff WHITTLE

Basic information

Original name

Addendum to Matroid Tree-Width

Name in Czech

Dodatek ke stromové šířce matroidů

Authors

HLINĚNÝ, Petr (203 Czech Republic, guarantor) and Geoff WHITTLE (554 New Zealand)

Edition

European Journal of Combinatorics, Elsevier, 2009, 0195-6698

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10101 Pure mathematics

Country of publisher

Netherlands

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

Impact factor

Impact factor: 0.822

RIV identification code

RIV/00216224:14330/09:00029118

Organization unit

Faculty of Informatics

UT WoS

000264631700029

Keywords in English

graph; matroid; tree-width; branch-width

Tags

International impact, Reviewed
Změněno: 25/2/2010 18:20, prof. RNDr. Petr Hliněný, Ph.D.

Abstract

V originále

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.)

In Czech

Poskytneme dodatečné argumenty k předchozímu článku Matroid tree{-}width, European J.~Combin.~27 (2006), 1117--1128, ve kterém Isolde Adler ukázala na neúplnost v roce 2007.

Links

GA201/08/0308, research and development project
Name: Využití strukturálních a "šířkových" parametrů v kombinatorice a algoritmické složitosti
Investor: Czech Science Foundation, Utilization of Structural and Width Parametres in Combinatorics and Algorithmic Complexity
1M0545, research and development project
Name: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science