Highly Influential

@inproceedings{Szeider2000FindingPI, title={Finding paths in graphs avoiding prescribed transitions}, author={Stefan Szeider}, year={2000} }

- Published 2000

Let v be a vertex of a graph G; a transition graph T (v) of v is a graph whose vertices are the edges incident with v. We consider graphs G with prescribed transition systems T = { T (v) | v ∈ V (G) }. A path P in G is called T -compatible, if each pair uv, vw of consecutive edges of P form an edge in T (v). Let A be a given class of graphs (closed under… CONTINUE READING

### Presentations referencing similar topics