Back to Results
First PageMeta Content
Graph 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 List

Document Date: 2009-04-29 03:46:21


Open Document

File Size: 168,71 KB

Share Result on Facebook
UPDATE