A monotone path in an edge-ordered graph
An edge-ordered graph is an ordered pair (G,f), where G is a graph and f is a bijective function, f:E(G)→{1,2,…,|E(G)|}. A monotone path of length k in (G,f) is a simple path Pk+1:v1v2…vk+1 in G such that either f({vi,vi+1})<f({vi+1,vi+2}) or f({vi,vi+1})>f({vi+1,vi}) for i=1,2,…,k−1....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1987-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171287000383 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|