<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2009-04-29 03:46:21Graph theory Graph operations Graph coloring Matroid theory Edge contraction Graph Bipartite graph Ear decomposition Pathwidth Line graph |
Add to Reading List |
| First Page | Document Content | |
|---|---|---|
Date: 2009-04-29 03:46:21Graph theory Graph operations Graph coloring Matroid theory Edge contraction Graph Bipartite graph Ear decomposition Pathwidth Line graph |
Add to Reading List |
On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´