Search Sciweavers | Sciweavers

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

Sang-il Oum

claim paper

Read More »

click to vote

JGT
2008

105views more JGT 2008»

The bond and cycle spaces of an infinite graph

13 years 5 months ago

Download www.math.uwaterloo.ca

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

Karel Casteels, R. Bruce Richter

claim paper

Read More »

« Prev « First page 2 / 6 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers