The robust chromatic number of certain graph classes

DOI10.7151/DMGT.2576MaRDI QIDQ6892106zbMATH OpenFDO

Authors Gábor Bacsó, Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer

Publication date 1 December 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2576

zbMATH Keywords

graph coloringrobust coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal set theory (05D05)

Cites work

• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. I: Theory
• Extremal graph theoretic questions for q-ary vectors
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The robust chromatic number of graphs
• Uniformization of linear arrays

This page was built for publication: The robust chromatic number of certain graph classes

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