Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number*
Work
Year: 2017
Type: article
Abstract: For a graph G and a tree‐decomposition of G , the chromatic number of is the maximum of , taken over all bags . The tree‐chromatic number of G is the minimum chromatic number of all tree‐decompositio... more
Source: Journal of Graph Theory
Authors Tony Huynh, Ringi Kim
Institutions Université Libre de Bruxelles, University of Waterloo
Cites: 3
Cited by: 2
Related to: 10
FWCI: 0.193
Citation percentile (by year/subfield): 47.76
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder European Research Council
Grant ID 279558