Rank-width is less than or equal to branch-width

We prove that the rank-width of the incidence graph of a graph G is either equal to or exactly one less than the branch-width of G, unless the maximum degree of G is

• Type: Journal
• Year: 2008
• Where: JGT
• Authors: Sang-il Oum
• Keywords: Branch-width, Incidence Graph, JGT 2008