Abstract
An edge-ordered graph is an ordered pair ( G, f), where G= G( V, E) is a graph and f is a bijective function, f: E( G)→{1,2,…,| E( G)|}. f is called an edge ordering of G. A monotone path of length k in ( G, f) is a simple path P k+1 : v 1,v 2,…,v k+1 in G such that either, f(( v i , v i+1 ))< f(( v i+1 , v i+2 )) or f(( v i , v i+1 ))> f(( v i+1 , v i+2 )) for i=1,2,…, k−1. Given an undirected graph G, denote by α( G) the minimum over all edge orderings of the maximum length of a monotone path. In this paper we give bounds on α( G) for various families of sparse graphs, including trees, planar graphs and graphs with bounded arboricity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
