Large monotone paths in graphs with bounded degree

DOI10.1007/S003730170031MaRDI QIDQ5952394zbMATH OpenOpenAlexFDO

Authors 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

monotone simple pathpacking

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)

Recommendations

• Degree Monotone Paths
• Monotone paths in dense edge-ordered graphs
• Ramsey numbers for degree monotone paths
• Monotone paths in edge-ordered sparse graphs
• Degree monotone paths and graph operations

Cited in

(14)

• A monotone path in an edge-ordered graph
• Problems and results in extremal combinatorics. I.
• Altitude of regular graphs with girth at least five
• Nearly-linear monotone paths in edge-ordered graphs
• Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
• Ramsey numbers for degree monotone paths
• The depression of a graph and \(k\)-kernels
• Trees with depression three
• The saturation number for the length of degree monotone paths
• Increasing paths in edge-ordered graphs: the hypercube and random graph
• Degree monotone paths and graph operations
• A class of graphs with depression three
• Long monotone trails in random edge-labellings of random graphs
• Finding monotone paths in edge-ordered graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952394)