![Graph theory / Graph operations / Graph coloring / Matroid theory / Edge contraction / Graph / Bipartite graph / Ear decomposition / Pathwidth / Line graph Graph theory / Graph operations / Graph coloring / Matroid theory / Edge contraction / Graph / Bipartite graph / Ear decomposition / Pathwidth / Line graph](https://www.pdfsearch.io/img/1edcacdbbb74b36303920f4eb9620845.jpg) Date: 2009-04-29 03:46:21Graph theory Graph operations Graph coloring Matroid theory Edge contraction Graph Bipartite graph Ear decomposition Pathwidth Line graph | | 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´Add to Reading ListSource URL: kam.mff.cuni.czDownload Document from Source Website File Size: 168,71 KBShare Document on Facebook
|