To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1895zFull metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Seymour, Paul D. | - |
| dc.date.accessioned | 2018-07-20T15:09:06Z | - |
| dc.date.available | 2018-07-20T15:09:06Z | - |
| dc.date.issued | 2016-01 | en_US |
| dc.identifier.citation | Seymour, Paul. (2016). Tree-chromatic number. JOURNAL OF COMBINATORIAL THEORY SERIES B, 116 (229 - 237. doi:10.1016/j.jctb.2015.08.002 | en_US |
| dc.identifier.issn | 0095-8956 | - |
| dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1895z | - |
| dc.description.abstract | Let us say a graph G has “tree-chromatic number” at most k if it admits a tree-decomposition (T, (X-t : t is an element of V (T))) such that G[X-t] has chromatic number at most k for each t is an element of V (T). This seems to be a new concept, and this paper is a collection of observations on the topic. In particular we show that there are graphs with tree-chromatic number two and with arbitrarily large chromatic number; and for all l >= 4, every graph with no triangle and with no induced cycle of length more than E has tree-chromatic number at most l - 2. (C) 2015 Elsevier Inc. All rights reserved. | en_US |
| dc.format.extent | 229 - 237 | en_US |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartof | JOURNAL OF COMBINATORIAL THEORY SERIES B | en_US |
| dc.rights | Author's manuscript | en_US |
| dc.title | Tree-chromatic number | en_US |
| dc.type | Journal Article | en_US |
| dc.identifier.doi | doi:10.1016/j.jctb.2015.08.002 | - |
| dc.date.eissued | 2015-08-21 | en_US |
| dc.identifier.eissn | 1096-0902 | - |
| pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| tree-chromatic_number.pdf | 107.17 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.