Matching structure and Pfaffian orientations of graphs
The first result of this thesis is a generation theorem for bricks. A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of a decomposition procedu...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/7232 |