Asymptotic values of clique partition numbers

DOI10.1007/BF02579286zbMath0492.05042OpenAlexW1966506233MaRDI QIDQ1167740

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

cliquescomplete subgraphsclique partition

Mathematics Subject Classification ID

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

Related Items (8)

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

Cites Work

• Topics in multiplicative number theory
• Unnamed Item
• Unnamed Item

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