Další formáty:
BibTeX
LaTeX
RIS
@article{637509, author = {Hliněný, Petr and Whittle, Geoff}, article_number = {7}, keywords = {graph; matroid; tree-width; branch-width}, language = {eng}, issn = {0195-6698}, journal = {European Journal of Combinatorics}, title = {Matroid Tree-Width}, url = {http://dx.doi.org/10.1016/j.ejc.2006.06.005}, volume = {27}, year = {2006} }
TY - JOUR ID - 637509 AU - Hliněný, Petr - Whittle, Geoff PY - 2006 TI - Matroid Tree-Width JF - European Journal of Combinatorics VL - 27 IS - 7 SP - 1117 EP - 1117 PB - Elsevier SN - 01956698 KW - graph KW - matroid KW - tree-width KW - branch-width UR - http://dx.doi.org/10.1016/j.ejc.2006.06.005 N2 - We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This extension was inspired by an original unpublished idea of Jim Geelen.) We prove that the tree-width of a graphic matroid is equal to that of its underlying graph. Furthermore, we extend the well-known relation between the branch-width and the tree-width of a graph to all matroids. ER -
HLINĚNÝ, Petr a Geoff WHITTLE. Matroid Tree-Width. \textit{European Journal of Combinatorics}. Elsevier, 2006, roč.~27, č.~7, s.~1117-1128. ISSN~0195-6698.
|