Contentment in graph theory: Covering graphs with cliques

1977/01/01 by James Orlin, James B. Orlin · 174 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Bipartite graph #Combinatorics #Computational Geometry and Mesh Generation #Discrete mathematics #Extremal graph theory #Graph #Graph theory #Line graph #Mathematics #Voltage graph #graph theory and CDMA systems

paper · pdf · doi:10.1016/1385-7258(77)90055-5

published in Indagationes Mathematicae (Proceedings) 80(5), 406-424 (Elsevier BV)

crossref issued 1977/01/01 · crossref published 1977/01/01 · crossref published-print 1977/01/01 · openalex publication_date 1977/01/01 · crossref created 2005/02/10 · crossref deposited 2019/01/29 · openalex created_date 2025/10/10 · crossref indexed 2026/06/12 · openalex updated_date 2026/08/02

Citations

• Sur deux propriétés des classes d'ensembles
• The complexity of theorem-proving procedures
• Some properties of line digraphs
• The Representation of a Graph by Set Intersections

Cited by

• Conformal Data-driven Control of Stochastic Multi-Agent Systems under Collaborative Signal Temporal Logic Specifications
• Covering graphs with few complete bipartite subgraphs
• Bipartite dimension [wikipedia]