A lower estimate for the achromatic number of irreducible graphs

DOI10.1016/0012-365X(81)90164-3zbMath0454.05027MaRDI QIDQ1149444

Attila Máté

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

achromatic numberindependent vertex set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

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

• Graph with given achromatic number
• Eigenvalues and partitionings of the edges of a graph
• Combinatorial Theorems on Classifications of Subsets of a Given Set