Asymptotic values of clique partition numbers

DOI10.1007/BF02579286MaRDI QIDQ1167740zbMATH OpenOpenAlexFDO

Authors Walter D. Wallis

Publication date 1982

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02579286

zbMATH Keywords

clique partitioncliquescomplete subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 3735866 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• Topics in multiplicative number theory

Cited in

(8)

• Clique partitions and clique coverings
• Eigenvalues and clique partitions of graphs
• An overview of graph covering and partitioning
• Pairwise balanced designs and sigma clique partitions
• Clique Partitions of Chordal Graphs
• On the partition and coloring of a graph by cliques
• Applications of edge coverings by cliques
• Spectral radius and clique partitions of graphs

This page was built for publication: Asymptotic values of clique partition numbers

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