scientific article; zbMATH DE number 4008419

From MaRDI portal
Publication:3758854





[For the entire collection see Zbl 0619.00006.] In a graph G, a set of vertices \(S\subseteq V(G)\) is n-dependent if \(\Delta ()\leq n\). The n-chromatic number of G, \(\chi_ n(G)\), is the smallest t such that V(G) can be partitioned into t sets each of which is n-dependent. Various results relating \(\chi_ n(G)\) to other parameters are presented. Additionally, we study the following property, related to Ramsey theory: We say that G \(\chi_ t\) arrows \((n_ 1,...,n_ k)\), denoted \(G\to^{\chi_ t}(n_ 1,...,n_ k)\), if for every factorization of \(G=F_ 1\oplus...\oplus F_ k\) we have \(\chi_ t(F_ i)\geq n_ i\) for some \(i\in \{1,...,k\}\).




Cited in
(36)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758854)