Abstract
An edge-ordering of a graph G=(V,E) is a bijection ϕ:E→{1,2,…,|E|}. Given an edge-ordering, a sequence of edges P=e1,e2,…,ek is an increasing path if it is a path in GG which satisfies ϕ(ei)
Author supplied keywords
Cite
CITATION STYLE
APA
De Silva, J., Molla, T., Pfender, F., Retter, T., & Tait, M. (2016). Increasing paths in edge-ordered graphs: The hypercube and random graph. Electronic Journal of Combinatorics, 23(2). https://doi.org/10.37236/5036
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free