A class of graphs with depression three

DOI10.1016/J.DISC.2012.05.011MaRDI QIDQ385391zbMATH OpenOpenAlexFDO

Authors Christina M. Mynhardt, M. Schurch

Publication date 2 December 2013

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

depressionedge ordering of a graphincreasing pathmonotone path

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Recommendations

• A construction of a class of graphs with depression three
• Trees with depression three
• A monotone path in an edge-ordered graph
• The depression of a graph
• A lower bound for the depression of trees

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
• Finding monotone paths in edge-ordered graphs
• 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
• The depression of a graph and the diameter of its line graph
• Trees with depression three

Cited in

(9)

• The depression of a graph and the diameter of its line graph
• On the \(\varepsilon\)-ascent chromatic index of complete graphs
• The depression of a graph and \(k\)-kernels
• Trees with depression three
• A construction of 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
• Oscillation of graphs

This page was built for publication: A class of graphs with depression three

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