On the public citation graph

Clique Covering of Graphs IV. Algorithms

https://doi.org/10.1137/0213005
0 signed · 34 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/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
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.21236/ad0705364openalex-snapshot
GRAPH THEORY
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.1007/11851561_13openalex-snapshot
Controlling Size When Aligning Multiple Genomic Sequences with Duplications
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_6openalex-snapshot
On the Tree-Degree of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-00281-5_14openalex-snapshot
The Edge-Intersection Graph of Induced Paths in a Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_42openalex-snapshot
On the Complete Width and Edge Clique Cover Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_19openalex-snapshot
Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs
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/bf01788656openalex-snapshot
On dimensional properties of graphs
inferred← citeshttps://doi.org/10.1007/s10878-016-0106-9openalex-snapshot
On the complete width and edge clique cover problems
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/0898-1221(91)90001-kopenalex-snapshot
The clique-partitioning problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100784openalex-snapshot
Maximal cliques summarization: Principles, problem classification, and algorithmic approaches
inferred← citeshttps://doi.org/10.1016/j.dam.2015.12.012openalex-snapshot
Induced cycles in triangle graphs
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.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.1017/s1446788700030147openalex-snapshot
Maximal-clique partitions of interval graphs
inferred← citeshttps://doi.org/10.1109/43.712101openalex-snapshot
Efficient BIST TPG design and test set compaction via input reduction
inferred← citeshttps://doi.org/10.1109/icpr48806.2021.9412040openalex-snapshot
Supervised Classification Using Graph-based Space Partitioning for Multiclass Problems
inferred← citeshttps://doi.org/10.1109/msn53354.2021.00022openalex-snapshot
A Novel Deployment Method for UAV-mounted Mobile Base Stations
inferred← citeshttps://doi.org/10.1142/s1793557123500365openalex-snapshot
On cycle graphs
inferred← citeshttps://doi.org/10.1142/s2811007225500105openalex-snapshot
A fundamental theorem on graph operators
inferred← citeshttps://doi.org/10.1142/s2811007225500191openalex-snapshot
The quadrangle graph operator
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.26493/1855-3974.1017.0acopenalex-snapshot
ℱ-WORM colorings of some 2-trees: partition vectors
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.7151/dmgt.1700openalex-snapshot
Path-neigborhood 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.