A lower estimate for the achromatic number of irreducible graphs
From MaRDI portal
Publication:1149444
DOI10.1016/0012-365X(81)90164-3zbMath0454.05027MaRDI QIDQ1149444
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On the Grundy number of Cameron graphs, On the achromatic number of signed graphs, On retracts, absolute retracts, and foldings in cographs, Achromatic numbers and graph operations, Concerning the achromatic number of graphs
Cites Work