Abstract
For each pair k, m of natural numbers there exists a natural number f(k, m) such that every f(k, m)‐chromatic graph contains a k‐connected subgraph of chromatic number at least m.
| Original language | English |
|---|---|
| Pages (from-to) | 367-371 |
| Number of pages | 5 |
| Journal | Journal of Graph Theory |
| Volume | 11 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jan 1987 |
| Externally published | Yes |
ASJC Scopus subject areas
- Geometry and Topology
Fingerprint
Dive into the research topics of 'Subgraphs of large connectivity and chromatic number in graphs of large chromatic number'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver