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
Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and K