Pages that link to "Item:Q1841931"
From MaRDI portal
The following pages link to Monotone paths in edge-ordered sparse graphs (Q1841931):
Displaying 16 items.
- Increasing paths in edge-ordered graphs: the hypercube and random graph (Q281608) (← links)
- A class of graphs with depression three (Q385391) (← links)
- Finding monotone paths in edge-ordered graphs (Q602679) (← links)
- A monotone path in an edge-ordered graph (Q1095926) (← links)
- Altitude of regular graphs with girth at least five (Q1781975) (← links)
- Research problems from the 18th British Combinatorial Conference (Q1810663) (← links)
- Nearly-linear monotone paths in edge-ordered graphs (Q2200054) (← links)
- Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs (Q2236638) (← links)
- Caterpillar arboricity of planar graphs (Q2370451) (← links)
- Monotone paths in dense edge-ordered graphs (Q2404821) (← links)
- The depression of a graph and \(k\)-kernels (Q2450123) (← links)
- Trees with depression three (Q2470454) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Long Monotone Trails in Random Edge-Labellings of Random Graphs (Q5222568) (← links)
- Most edge‐orderings of <i>K</i><sub><i>n</i></sub> have maximal altitude (Q5381056) (← links)
- Large monotone paths in graphs with bounded degree (Q5952394) (← links)