The robust chromatic number of certain graph classesBacsó, Gábor (Avtor) Bujtás, Csilla (Avtor) Patkós, Balázs (Avtor) Tuza, Zsolt (Avtor) Vizer, Máté (Avtor) graph coloringrobust coloringA $1$-selection $f$ of a graph $G$ is a partial function $f : V (G) \to E(G)$ such that $f(v)$ is incident to $v$ for every vertex $v$, where $f$ is defined. The $1$- removed $G_f$ is the graph $(V (G), E(G) \setminus\ f[V (G)])$. The ($1$-)robust chromatic number $\chi_1(G)$ is the minimum of $\chi(G_f)$ over all $1$-selections $f$ of $G$. We determine the robust chromatic number of complete multipartite graphs and Kneser graphs and prove tight lower and upper bounds on the robust chromatic number of chordal graphs and some of their extensively studied subclasses, with respect to their ordinary chromatic number.20252026-03-05 11:10:26Članek v reviji180285UDK: 519.17ISSN pri članku: 1234-3099DOI: 10.7151/dmgt.2576COBISS_ID: 270576899sl