On characterizing graphs with branchwidth at most four
There are several ways in which we can characterize classes of graphs. One such way of classifying graphs is by their branchwidth. In working to characterize the class of graphs with branchwidth at most four beta 4 we have found a set of reductions that reduces members of beta 4 to the zero graph. W...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1911/17460 |