Altitude of regular graphs with girth at least five
From MaRDI portal
Publication:1781975
DOI10.1016/j.disc.2005.02.007zbMath1062.05131MaRDI QIDQ1781975
Alewyn P. Burger, Christina M. Mynhardt, T. C. Clark, B. Falvai, N. D. R. Henderson
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
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Finding monotone paths in edge-ordered graphs, Altitude of wheels and wheel-like graphs, Trees with depression three
Cites Work
- 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
- Some Combinatorial Theorems on Monotonicity
- Large monotone paths in graphs with bounded degree
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item