Rank‐width is less than or equal to branch‐width
In: Journal of Graph Theory, Jg. 57 (2008-03-01), Heft 3, S. 239-244
Online
serialPeriodical
Zugriff:
We prove that the rank‐width of the incidence graph of a graph Gis either equal to or exactly one less than the branch‐width of G, unless the maximum degree of Gis 0 or 1. This implies that rank‐width of a graph is less than or equal to branch‐width of the graph unless the branch‐width is 0. Moreover, this inequality is tight. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 239–244, 2008
Titel: |
Rank‐width is less than or equal to branch‐width
|
---|---|
Autor/in / Beteiligte Person: | Oum, Sang‐il |
Link: | |
Zeitschrift: | Journal of Graph Theory, Jg. 57 (2008-03-01), Heft 3, S. 239-244 |
Veröffentlichung: | 2008 |
Medientyp: | serialPeriodical |
ISSN: | 0364-9024 (print) ; 1097-0118 (print) |
DOI: | 10.1002/jgt.20280 |
Sonstiges: |
|