Clique Partitions of Chordal Graphs

DOI10.1017/S0963548300000808zbMath0793.05081OpenAlexW1981896282WikidataQ105709475 ScholiaQ105709475MaRDI QIDQ4290093

Edward T. Ordman, Yechezkel Zalcstein

Publication date: 28 April 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000808

zbMATH Keywords

partitionsplit graphchordal graphcliquesclique partitionthreshold graphclique covering

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 (1)

The size of chordal, interval and threshold subgraphs

Cites Work

• Unnamed Item
• Clique partitions and clique coverings
• On a clique covering problem of Orlin
• Asymptotic values of clique partition numbers
• The size of chordal, interval and threshold subgraphs
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• The Representation of a Graph by Set Intersections

This page was built for publication: Clique Partitions of Chordal Graphs