Independence, irredundance, degrees and chromatic number in graphs
From MaRDI portal
Publication:1861218
DOI10.1016/S0012-365X(02)00585-XzbMath1015.05069OpenAlexW2069326022MaRDI QIDQ1861218
Publication date: 16 March 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00585-x
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
This page was built for publication: Independence, irredundance, degrees and chromatic number in graphs