scientific article; zbMATH DE number 125481

From MaRDI portal
Publication:4027183





[For the entire collection see Zbl 0748.00023.] It was shown in \textit{R. L. Brooks} [Proc. Camb. Philos. Soc. 37, 194-197 (1941; Zbl 0027.26403)] that if a connected graph \(G\) does not contain \(K_{1,k+1}\), \(k\geq 3\), then \(G\) is \(k\)-colorable unless \(G=K_{k+1}\). The paper under review generalizes this result by replacing the star \(K_{1,k+1}\) by an arbitrary tree with \(k+2\) vertices.











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 Q4027183)