Altitude of regular graphs with girth at least five

DOI10.1016/j.disc.2005.02.007zbMath1062.05131OpenAlexW2102693912MaRDI QIDQ1781975

T. C. Clark, N. D. R. Henderson, B. Falvai, Christina M. Mynhardt, Alewyn P. Burger

Publication date: 10 June 2005

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

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

zbMATH Keywords

SnarksEdge orderingIncreasing pathsMonotone paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (8)

Finding monotone paths in edge-ordered graphs ⋮ A class of graphs with depression three ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ Most edge‐orderings of K_n have maximal altitude ⋮ The depression of a graph and \(k\)-kernels ⋮ Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs ⋮ Trees with depression three ⋮ Altitude of wheels and wheel-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
• A monotone path in an edge-ordered graph
• Problems and results in extremal combinatorics. I.
• Monotone paths in edge-ordered sparse graphs
• Increasing paths in edge ordered graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Decompositions and reductions of snarks
• Some Combinatorial Theorems on Monotonicity
• Large monotone paths in graphs with bounded degree

This page was built for publication: Altitude of regular graphs with girth at least five