A monotone path in an edge-ordered graph
From MaRDI portal
Recommendations
Cited in
(10)- Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
- The depression of a graph and \(k\)-kernels
- Trees with depression three
- Nearly-linear monotone paths in edge-ordered graphs
- Monotone paths in edge-ordered sparse graphs
- A class of graphs with depression three
- Finding monotone paths in edge-ordered graphs
- Erdős-Hajnal-type results for monotone paths
- Oscillation of graphs
- Altitude of regular graphs with girth at least five
This page was built for publication: A monotone path in an edge-ordered graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095926)