A monotone path in an edge-ordered graph

DOI10.1155/S0161171287000383MaRDI QIDQ1095926zbMATH OpenOpenAlexFDO

Authors Arie Bialostocki, Yehuda Roditty

Publication date 1987

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46238

zbMATH Keywords

monotone pathedge-ordered graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Recommendations

• Monotone paths in edge-ordered sparse graphs
• Large monotone paths in graphs with bounded degree
• Nearly-linear monotone paths in edge-ordered graphs
• Monotone paths in dense edge-ordered graphs
• Finding monotone paths in edge-ordered graphs

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)