On the partition and coloring of a graph by cliques

DOI10.1016/0012-365X(93)90576-FzbMath0784.05027OpenAlexW2066466628MaRDI QIDQ687122

Guo-Hui Zhang, Walter D. Wallis

Publication date: 1 November 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90576-f

zbMATH Keywords

boundscliqueschromatic indexcoloringclique partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)
• Minimal clique partitions and pairwise balanced designs
• Asymptotic values of clique partition numbers
• Topics in multiplicative number theory
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the partition and coloring of a graph by cliques