Abstract
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function the graph contains a ray whose sequence of labels eventually exceeds. We obtain a characterization of these graphs by producing a small family of dominating graphs with the property that every dominating graph must contain some member of the family.
| Original language | English |
|---|---|
| Pages (from-to) | 16-24 |
| Number of pages | 9 |
| Journal | Journal of the London Mathematical Society |
| Volume | 49 |
| Issue number | 1 |
| DOIs | |
| State | Published - Feb 1994 |