Name
Abstract | ||
|---|---|---|
We show that, given an infinite cardinal μ, a graph has colouring number at most μ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its vertices that simultaneously witnesses its colouring number and its cardinality. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00493-019-4045-9 | Combinatorica |
Keywords | Field | DocType |
05C63, 05C75, 05C15, 03E05 | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Cardinality,If and only if,Mathematics | Journal |
Volume | Issue | ISSN |
39 | 6 | 0209-9683 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathan Bowler | 1 | 16 | 6.83 |
| Johannes Carmesin | 2 | 29 | 7.08 |
| Péter Komjáth | 3 | 0 | 0.34 |
| Christian Reiher | 4 | 3 | 4.49 |