Large monotone paths in graphs with bounded degree

DOI10.1007/s003730170031zbMath1010.05044OpenAlexW2073394867MaRDI QIDQ5952394

Raphael Yuster

Publication date: 9 January 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730170031

zbMATH Keywords

packingmonotone simple path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Increasing paths in edge-ordered graphs: the hypercube and random graph ⋮ Finding monotone paths in edge-ordered graphs ⋮ A class of graphs with depression three ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ Problems and results in extremal combinatorics. I. ⋮ 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 ⋮ Long Monotone Trails in Random Edge-Labellings of Random Graphs

This page was built for publication: Large monotone paths in graphs with bounded degree