On the partition and coloring of a graph by cliques

DOI10.1016/0012-365X(93)90576-FMaRDI QIDQ687122zbMATH OpenOpenAlexFDO

Authors 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

boundsclique partitioncoloringchromatic indexcliques

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 4031746
• On clique partitions of split graphs
• scientific article; zbMATH DE number 3885943
• scientific article; zbMATH DE number 3999981
• Clique and anticlique partitions of graphs
• Clique partitions and clique coverings
• Graph colourings and partitions
• Coloring the Maximal Cliques of Graphs
• scientific article; zbMATH DE number 4031729
• Clique-partitioned graphs

Cites work

• scientific article; zbMATH DE number 3838071 (Why is no real title available?)
• scientific article; zbMATH DE number 4006279 (Why is no real title available?)
• scientific article; zbMATH DE number 4059415 (Why is no real title available?)
• scientific article; zbMATH DE number 3735866 (Why is no real title available?)
• scientific article; zbMATH DE number 3485815 (Why is no real title available?)
• scientific article; zbMATH DE number 3563140 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 3590280 (Why is no real title available?)
• scientific article; zbMATH DE number 4116583 (Why is no real title available?)
• scientific article; zbMATH DE number 3797768 (Why is no real title available?)
• scientific article; zbMATH DE number 3337688 (Why is no real title available?)
• scientific article; zbMATH DE number 3392464 (Why is no real title available?)
• Asymptotic values of clique partition numbers
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Minimal clique partitions and pairwise balanced designs
• The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)
• Topics in multiplicative number theory

Cited in

(17)

• Clique-coloring numbers of some product graphs
• On a k-clique-join of a class of partitionalble graphs
• scientific article; zbMATH DE number 4029627 (Why is no real title available?)
• scientific article; zbMATH DE number 4160751 (Why is no real title available?)
• Multiple vertex coverings by cliques
• Eigenvalues and clique partitions of graphs
• Red-blue clique partitions and (1-1)-transversals
• Partitioning the power set of \([n]\) into \(C_k\)-free parts
• scientific article; zbMATH DE number 812085 (Why is no real title available?)
• scientific article; zbMATH DE number 4156479 (Why is no real title available?)
• Covering the complete graph by partitions
• scientific article; zbMATH DE number 3914369 (Why is no real title available?)
• scientific article; zbMATH DE number 426170 (Why is no real title available?)
• \(k\)-clique partition of complete \(k\)-uniform hypergraphs
• scientific article; zbMATH DE number 3885943 (Why is no real title available?)
• scientific article; zbMATH DE number 4031746 (Why is no real title available?)
• Chromatic partitions of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687122)