Trees with depression three

DOI10.1016/j.disc.2007.07.039zbMath1149.05042OpenAlexW1985568077MaRDI QIDQ2470454

Christina M. Mynhardt

Publication date: 14 February 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.039

zbMATH Keywords

treeincreasing pathmonotone pathdepressionedge ordering

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Finding monotone paths in edge-ordered graphs, A class of graphs with depression three, The depression of a graph and \(k\)-kernels

Cites Work

• Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
• A monotone path in an edge-ordered graph
• Altitude of regular graphs with girth at least five
• Monotone paths in edge-ordered sparse graphs
• Increasing paths in edge ordered graphs
• Some Combinatorial Theorems on Monotonicity
• Large monotone paths in graphs with bounded degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item