On the public citation graph

A survey of packings and coverings of graphs

https://doi.org/10.1007/bfb0060104
0 signed · 31 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.1002/sapm1934131363openalex-snapshot
A Six Color Problem
inferredcites →https://doi.org/10.1007/bf01109925openalex-snapshot
Die toroidale Dicke des vollst�ndigen Graphen
inferredcites →https://doi.org/10.1007/bfb0060112openalex-snapshot
A many-facetted problem of zarankiewicz
inferredcites →https://doi.org/10.1016/0095-8956(71)90065-7openalex-snapshot
Graphs with forbidden subgraphs
inferredcites →https://doi.org/10.1016/s0021-9800(67)80014-0openalex-snapshot
A coarseness conjecture of Erdös
inferredcites →https://doi.org/10.1016/s0021-9800(70)80023-0openalex-snapshot
L'épaisseur des graphes complets K34 et K40
inferredcites →https://doi.org/10.1017/s0305004100037385openalex-snapshot
On the thickness of the complete bipartite graph
inferredcites →https://doi.org/10.1090/s0002-9904-1962-10850-7openalex-snapshot
Every planar graph with nine points has a nonplanar complement
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.221openalex-snapshot
On the Problem of Decomposing a Graph into n Connected Factors
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.12openalex-snapshot
Decomposition of Finite Graphs Into Forests
inferredcites →https://doi.org/10.4153/cjm-1965-084-2openalex-snapshot
The Thickness of the Complete Graph
inferredcites →https://doi.org/10.4153/cjm-1968-085-6openalex-snapshot
The Coarseness of the Complete Graph
inferredcites →https://doi.org/10.4153/cjm-1969-109-4openalex-snapshot
Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
inferredcites →https://doi.org/10.4153/cjm-1969-121-3openalex-snapshot
The Coarseness of the Complete Bipartite Graph
inferredcites →https://doi.org/10.6028/jres.072b.023openalex-snapshot
Thickness and connectivity in graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/bf01085015openalex-snapshot
Graph theory
inferred← citeshttps://doi.org/10.1007/bf01098364openalex-snapshot
The maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf01580121openalex-snapshot
On the facial structure of set packing polyhedra
inferred← citeshttps://doi.org/10.1007/bfb0066436openalex-snapshot
Some recent results in topological graph theory
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90105-3openalex-snapshot
Partition of the edges of the directed complete graph into 4-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.023openalex-snapshot
Three ways to cover a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2018.02.003openalex-snapshot
Local and union boxicity
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.11.045openalex-snapshot
Packing and covering with linear programming: A survey
inferred← citeshttps://doi.org/10.1016/j.matpr.2020.12.1039openalex-snapshot
Packing of silicate and oxide networks
inferred← citeshttps://doi.org/10.1080/00207168208803311openalex-snapshot
Determining the number of internal stability of a graph
inferred← citeshttps://doi.org/10.1108/mrr-11-2014-0262openalex-snapshot
Reducing transportation greenhouse gas emissions with collaborative distribution
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1970.tb45132.xopenalex-snapshot
COVERING AND PACKING IN GRAPHS, I.
inferred← citeshttps://doi.org/10.37236/3214openalex-snapshot
On the Shannon Capacity of Triangular Graphs
inferred← citeshttps://doi.org/10.4153/cmb-1975-123-4openalex-snapshot
Packing and Covering of the Complete Graph with 4-Cycles*
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.