Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour

doi:10.1002/jgt.3190110311

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

N. Alon, D. Kleitman, C. Thomassen, M. Saks, P. Seymour

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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 (US)
Pages (from-to)	367-371
Number of pages	5
Journal	Journal of Graph Theory
Volume	11
Issue number	3
DOIs	https://doi.org/10.1002/jgt.3190110311
State	Published - Jan 1 1987
Externally published	Yes

All Science Journal Classification (ASJC) codes

Geometry and Topology

Access to Document

10.1002/jgt.3190110311

Cite this

@article{bacaf2705b1e4fd7a6b9f79cfcb42678,

title = "Subgraphs of large connectivity and chromatic number in graphs of large chromatic number",

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.",

author = "N. Alon and D. Kleitman and C. Thomassen and M. Saks and P. Seymour",

year = "1987",

month = jan,

day = "1",

doi = "10.1002/jgt.3190110311",

language = "English (US)",

volume = "11",

pages = "367--371",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "3",

}

TY - JOUR

T1 - Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

AU - Alon, N.

AU - Kleitman, D.

AU - Thomassen, C.

AU - Saks, M.

AU - Seymour, P.

PY - 1987/1/1

Y1 - 1987/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84986505805&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986505805&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190110311

DO - 10.1002/jgt.3190110311

M3 - Article

AN - SCOPUS:84986505805

SN - 0364-9024

VL - 11

SP - 367

EP - 371

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 3

ER -

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this