Trees with depression three
From MaRDI portal
Recommendations
Cites work
- A lower bound for the depression of trees
- A monotone path in an edge-ordered graph
- Altitude of regular graphs with girth at least five
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 2147937 (Why is no real title available?)
- Increasing paths in edge ordered graphs
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
- Large monotone paths in graphs with bounded degree
- Monotone paths in edge-ordered sparse graphs
- Some Combinatorial Theorems on Monotonicity
- The depression of a graph
Cited in
(8)- The depression of a graph and \(k\)-kernels
- A construction of a class of graphs with depression three
- Three tree-paths
- A class of graphs with depression three
- Edge colourings and the depression of a graph
- A lower bound for the depression of trees
- The depression of a graph
- Finding monotone paths in edge-ordered graphs
This page was built for publication: Trees with depression three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2470454)