Monotone paths in edge-ordered sparse graphs

DOI10.1016/S0012-365X(00)00174-6zbMath0961.05040OpenAlexW1976694075MaRDI QIDQ1841931

Barack Shoham, Raphael Yuster, Yehuda Roditty

Publication date: 21 May 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00174-6

zbMATH Keywords

linear arboricitysparse graphsmonotone pathstar arboricity

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (12)

Increasing paths in edge-ordered graphs: the hypercube and random graph ⋮ Caterpillar arboricity of planar graphs ⋮ Finding monotone paths in edge-ordered graphs ⋮ A class of graphs with depression three ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ Most edge‐orderings of K_n have maximal altitude ⋮ The depression of a graph and \(k\)-kernels ⋮ Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs ⋮ Trees with depression three ⋮ Altitude of regular graphs with girth at least five ⋮ Research problems from the 18th British Combinatorial Conference ⋮ Long Monotone Trails in Random Edge-Labellings of Random Graphs

This page was built for publication: Monotone paths in edge-ordered sparse graphs