The chromatic covering number of a graph

DOI10.1002/jgt.20127zbMath1134.05314OpenAlexW4240570119MaRDI QIDQ5469139

Claude Tardif, Reza Naserasr

Publication date: 16 May 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20127

zbMATH Keywords

homomorphismchromatic numberscover degeneracy

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On tension-continuous mappings ⋮ On the chromatic number of general Kneser hypergraphs

This page was built for publication: The chromatic covering number of a graph