On the public citation graph
Covering graphs by the minimum number of equivalence relations
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0001-8708(76)90104-3openalex-snapshot
Finite-dimensional multilinear algebra
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/0097-3165(74)90018-1openalex-snapshot
Solution of a problem of A. Ehrenfeucht and J. Mycielski
inferredcites →https://doi.org/10.1016/0097-3165(85)90048-2openalex-snapshot
An extremal problem for sets with applications to graph theory
inferredcites →https://doi.org/10.1016/s0304-0208(08)73020-2openalex-snapshot
Clique Coverings of Complements of Paths and Cycles
inferredcites →https://doi.org/10.1016/s0304-0208(08)73498-4openalex-snapshot
Covering Graphs by Equivalence Relations
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/9783527670468.ch05openalex-snapshot
Computational Complexity of Graphs
inferred← citeshttps://doi.org/10.1002/jgt.20367openalex-snapshot
On set intersection representations of graphs
inferred← citeshttps://doi.org/10.1002/jgt.21864openalex-snapshot
Local Clique Covering of Claw-Free Graphs
inferred← citeshttps://doi.org/10.1002/jgt.23111openalex-snapshot
Some results and problems on clique coverings of hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-06653-5_14openalex-snapshot
Avoiding Exponential Explosion in Petri Net Models of Control Flows
inferred← citeshttps://doi.org/10.1007/978-3-319-44618-9_27openalex-snapshot
Secret Sharing Schemes for Dense Forbidden Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24508-4openalex-snapshot
Boolean Function Complexity: Advances and Frontiers
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_10openalex-snapshot
Secret Sharing Schemes for Very Dense Graphs
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/bf01205076openalex-snapshot
A note on induced cycles in Kneser graphs
inferred← citeshttps://doi.org/10.1007/s00145-014-9195-8openalex-snapshot
Secret-Sharing Schemes for Very Dense Graphs
inferred← citeshttps://doi.org/10.1007/s00224-016-9668-2openalex-snapshot
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
inferred← citeshttps://doi.org/10.1007/s00224-017-9787-4openalex-snapshot
Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1448-7openalex-snapshot
Erdős–Pyber Theorem for Hypergraphs and Secret Sharing
inferred← citeshttps://doi.org/10.1007/s00493-023-00016-9openalex-snapshot
Prague Dimension of Random Graphs
inferred← citeshttps://doi.org/10.1007/s10474-016-0586-1openalex-snapshot
Edge clique covering sum of graphs
inferred← citeshttps://doi.org/10.1007/s11856-022-2365-8openalex-snapshot
Dimension-free bounds and structural results in communication complexity
inferred← citeshttps://doi.org/10.1007/s41980-018-0016-yopenalex-snapshot
Biclique Cover and Local Clique Cover of Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90168-hopenalex-snapshot
A simple lower bound on edge coverings 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/j.dam.2010.08.012openalex-snapshot
Covering line graphs with equivalence relations
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.014openalex-snapshot
Edge-intersection graphs of boundary-generated paths in a grid
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.036openalex-snapshot
On covering graphs by complete bipartite subgraphs
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.ejc.2020.103097openalex-snapshot
On the product dimension of clique factors
inferred← citeshttps://doi.org/10.1016/j.endm.2017.11.019openalex-snapshot
Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.02.001openalex-snapshot
Domination in transitive colorings of tournaments
inferred← citeshttps://doi.org/10.1063/5.0200632openalex-snapshot
Fractal networks: Topology, dimension, and complexity
inferred← citeshttps://doi.org/10.1090/tran/9730openalex-snapshot
The Helly number of Hamming balls and related problems
inferred← citeshttps://doi.org/10.1093/comnet/cnaa037openalex-snapshot
Graph fractal dimension and the structure of fractal networks
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00088openalex-snapshot
The Orthogonal Vectors Conjecture and Non-Uniform Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1109/infocom.2017.8056956openalex-snapshot
Motif clustering and overlapping clustering for social network analysis
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/tfuzz.2019.2946526openalex-snapshot
An $N$-Soft Set Approach to Rough Sets
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/tnnls.2024.3397926openalex-snapshot
A Graph-Neural-Network-Powered Solver Framework for Graph Optimization Problems
inferred← citeshttps://doi.org/10.1137/24m1718299openalex-snapshot
The Orthogonal Vectors Conjecture and Nonuniform Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1137/s0097539705447001openalex-snapshot
Disproving the Single Level Conjecture
inferred← citeshttps://doi.org/10.1145/3527311openalex-snapshot
Synthesizing fine-grained synchronization protocols for implicit monitors
inferred← citeshttps://doi.org/10.1145/3798129.3800852openalex-snapshot
Near-Optimal Directed Euclidean Spanners in High Dimensions
inferred← citeshttps://doi.org/10.1360/ssi-2024-0129openalex-snapshot
Exact algorithms for maximum independent set problem on hypergraphs
inferred← citeshttps://doi.org/10.2989/16073606.2014.981691openalex-snapshot
On equality in an upper bound for the equivalence domination number
inferred← citeshttps://doi.org/10.35834/mjms/1369746398openalex-snapshot
The Equivalence Number of a Line Graph
inferred← citeshttps://doi.org/10.37236/2698openalex-snapshot
Product Dimension of Forests and Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.4204/eptcs.315.3openalex-snapshot
Discrete-Time Quantum Walks on Oriented Graphs
inferred← citeshttps://doi.org/10.4230/dagsemproc.06111.8openalex-snapshot
Graphs and Circuits: Some Further Remarks
inferred← citeshttps://doi.org/10.4230/lipics.itc.2021.16openalex-snapshot
Around a biclique cover conjecture
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.83openalex-snapshot
OV Graphs Are (Probably) Hard Instances
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.1410.7237openalex-snapshot
A New Perspective on the Windows Scheduling Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1503.02380openalex-snapshot
Sigma clique covering of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1512.09328openalex-snapshot
Homology Computation of Large Point Clouds using Quantum Annealing
inferred← citeshttps://doi.org/10.48550/arxiv.1607.04703openalex-snapshot
Graph Hausdorff dimension, Kolmogorov complexity and construction of fractal graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1912.11385openalex-snapshot
Graph fractal dimension and structure of fractal networks: a combinatorial perspective
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.