On the public citation graph

Clique coverings of graphs — A survey

https://doi.org/10.1007/bfb0071509
0 signed · 51 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02579286openalex-snapshot
Asymptotic values of clique partition numbers
inferredcites →https://doi.org/10.1007/bfb0071513openalex-snapshot
On clique covering numbers of cubic graphs
inferredcites →https://doi.org/10.1016/0012-365x(82)90085-1openalex-snapshot
On a clique covering problem of orlin
inferredcites →https://doi.org/10.1016/0012-365x(83)90071-7openalex-snapshot
Finite linear spaces and projective planes
inferredcites →https://doi.org/10.1016/0097-3165(73)90065-4openalex-snapshot
Intersection properties of finite sets
inferredcites →https://doi.org/10.1016/1385-7258(77)90055-5openalex-snapshot
Contentment in graph theory: Covering graphs with cliques
inferredcites →https://doi.org/10.1090/s0002-9904-1941-07573-7openalex-snapshot
A problem in partitions
inferredcites →https://doi.org/10.18910/7296openalex-snapshot
On $t$-designs
inferredcites →https://doi.org/10.4064/fm-33-1-303-307openalex-snapshot
Sur deux propriétés des classes d'ensembles
inferredcites →https://doi.org/10.4153/cjm-1966-014-3openalex-snapshot
The Representation of a Graph by Set Intersections

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.21864openalex-snapshot
Local Clique Covering of Claw-Free Graphs
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1356openalex-snapshot
Embeddings of Star Graphs into Optical Meshes without Bends
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_20openalex-snapshot
On the Intractability Landscape of Digraph Intersection Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/bf01086177openalex-snapshot
Graph theory (algorithmic, algebraic, and metric problems)
inferred← citeshttps://doi.org/10.1007/bf02022096openalex-snapshot
Extensions of graph inversion to support an artificially intelligent modeling environment
inferred← citeshttps://doi.org/10.1007/s00500-021-05670-zopenalex-snapshot
Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
inferred← citeshttps://doi.org/10.1007/s10474-016-0586-1openalex-snapshot
Edge clique covering sum of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90098-1openalex-snapshot
Minimal clique partitions and pairwise balanced designs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90297-fopenalex-snapshot
On clique partitions of split graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90576-fopenalex-snapshot
On the partition and coloring of a graph by cliques
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00037-dopenalex-snapshot
On the equivalence covering number of splitgraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90006-6openalex-snapshot
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90061-7openalex-snapshot
Applications of edge coverings by cliques
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00076-popenalex-snapshot
Clique covering and clique partition in generalizations of line graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2016.11.006openalex-snapshot
A clique covering MIP model for the irregular strip packing problem
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.035openalex-snapshot
Edge clique partition in ( k , ℓ ) -graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.008openalex-snapshot
Pairwise balanced designs and sigma clique partitions
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112884openalex-snapshot
An overview of graph covering and partitioning
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100628openalex-snapshot
Fast constructive and improvement heuristics for edge clique covering
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.08.002openalex-snapshot
Parliament seating assignment problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.018openalex-snapshot
Compressed cliques graphs, clique coverings and positive zero forcing
inferred← citeshttps://doi.org/10.1017/fms.2024.120openalex-snapshot
The power of many colours
inferred← citeshttps://doi.org/10.1109/ifsa-nafips.2013.6608510openalex-snapshot
Applications of realizable Boolean matrices in graph theory
inferred← citeshttps://doi.org/10.1109/isit.2016.7541519openalex-snapshot
Inference of latent network features via co-intersection representations of graphs
inferred← citeshttps://doi.org/10.1109/isit.2019.8849253openalex-snapshot
Directed Intersection Representations and the Information Content of Digraphs
inferred← citeshttps://doi.org/10.1109/tit.2020.3033168openalex-snapshot
Directed Intersection Representations and the Information Content of Digraphs
inferred← citeshttps://doi.org/10.1109/tnet.2017.2728638openalex-snapshot
Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations
inferred← citeshttps://doi.org/10.1109/vtcfall.2018.8691041openalex-snapshot
Graph-Based Dynamic Zone Configurations for Resource Management in V2V Communications
inferred← citeshttps://doi.org/10.11606/d.55.2015.tde-25062015-111716openalex-snapshot
Modelos matemáticos para o problema de empacotamento em faixas de peças irregulares
inferred← citeshttps://doi.org/10.11606/t.55.2020.tde-29072020-094550openalex-snapshot
Irregular and quasi-polyomino strip packing problems
inferred← citeshttps://doi.org/10.13001/1081-3810.1400openalex-snapshot
On the minimum vector rank of multigraphs
inferred← citeshttps://doi.org/10.2298/fil2422923jopenalex-snapshot
The clique partition edge-fault numbers of some networks
inferred← citeshttps://doi.org/10.3233/ifs-162189openalex-snapshot
Cliques and clique covers in fuzzy graphs
inferred← citeshttps://doi.org/10.47852/bonviewjcce2202176openalex-snapshot
Optimization in Business Trade by Using Fuzzy Incidence Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1205.2483openalex-snapshot
Edge-clique graphs of cocktail parties have unbounded rankwidth
inferred← citeshttps://doi.org/10.48550/arxiv.1206.1993openalex-snapshot
Independent sets in edge-clique graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1210.6965openalex-snapshot
Local Clique Covering of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1411.0266openalex-snapshot
Pairwise Balanced Designs and Sigma Clique Partitions
inferred← citeshttps://doi.org/10.48550/arxiv.1503.02380openalex-snapshot
Sigma clique covering of graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.