On the public citation graph
Colouring random graphs
0 signed · 82 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.1002/ecja.4410650603openalex-snapshot
Probabilistic analysis of a heuristic graph coloring algorithm
inferredcites →https://doi.org/10.1002/jgt.3190090307openalex-snapshot
Random hypergraph coloring algorithms and the weak chromatic number
inferredcites →https://doi.org/10.1007/3-540-08442-8_114openalex-snapshot
Expected Behavior of Graph Coloring Algorithms
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1016/0020-0190(76)90065-xopenalex-snapshot
A note on the complexity of the chromatic number problem
inferredcites →https://doi.org/10.1016/0020-0190(84)90013-9openalex-snapshot
Backtrack: An O(1) expected time algorithm for the graph coloring problem
inferredcites →https://doi.org/10.1016/0166-218x(83)90022-7openalex-snapshot
On the chromatic forcing number of a random graph
inferredcites →https://doi.org/10.1016/0196-6774(84)90003-8openalex-snapshot
Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
inferredcites →https://doi.org/10.1016/0196-6774(85)90044-6openalex-snapshot
A theoretical analysis of backtracking in the graph coloring problem
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50015-5openalex-snapshot
GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
inferredcites →https://doi.org/10.1016/s0304-0208(08)73108-6openalex-snapshot
Easy Solutions for the K–Center Problem or the Dominating Set Problem on Random Graphs
inferredcites →https://doi.org/10.1017/s0305004100059181openalex-snapshot
Asymptotic properties of random subsets of projective spaces
inferredcites →https://doi.org/10.1017/s0305004100059648openalex-snapshot
Achromatic numbers of random graphs
inferredcites →https://doi.org/10.1017/s0305004100060205openalex-snapshot
On the probable behaviour of some algorithms for finding the stability number of a graph
inferredcites →https://doi.org/10.1093/comjnl/14.1.38openalex-snapshot
An algorithm for the chromatic number of a graph
inferredcites →https://doi.org/10.1093/comjnl/19.2.182openalex-snapshot
On Various Algorithms for Estimating the Chromatic Number of a Graph
inferredcites →https://doi.org/10.1093/comjnl/23.4.307openalex-snapshot
Timetable construction - an annotated bibliography
inferredcites →https://doi.org/10.1112/s0025579300003260openalex-snapshot
On circuits and subgraphs of chromatic graphs
inferredcites →https://doi.org/10.1137/0202026openalex-snapshot
An Algorithm for Determining the Chromatic Number of a Graph
inferredcites →https://doi.org/10.1137/0206046openalex-snapshot
Determining the Stability Number of a Graph
inferredcites →https://doi.org/10.1137/0208001openalex-snapshot
Determining the Chromatic Number of a Graph
inferredcites →https://doi.org/10.1145/321832.321837openalex-snapshot
An Algorithm for the Chromatic Number of a Graph
inferredcites →https://doi.org/10.1145/321921.321926openalex-snapshot
The Complexity of Near-Optimal Graph Coloring
inferredcites →https://doi.org/10.1145/359094.359101openalex-snapshot
New methods to color the vertices of a graph
inferredcites →https://doi.org/10.1145/800070.802207openalex-snapshot
A new approximate graph coloring algorithm
inferredcites →https://doi.org/10.1287/mnsc.19.4.456openalex-snapshot
Chromatic Scheduling and the Chromatic Number Problem
inferredcites →https://doi.org/10.6028/jres.084.024openalex-snapshot
A graph coloring algorithm for large scheduling problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.0.co;2-zopenalex-snapshot
Algorithmic theory of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20716openalex-snapshot
The Greedy Independent Set in a Random Graph with Given Degrees
inferred← citeshttps://doi.org/10.1002/rsa.21064openalex-snapshot
Large deviations of the greedy independent set algorithm on sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.21200openalex-snapshot
Greedy maximal independent sets via local limits
inferred← citeshttps://doi.org/10.1002/rsa.3240010404openalex-snapshot
On the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240030402openalex-snapshot
Large Cliques Elude the Metropolis Process
inferred← citeshttps://doi.org/10.1007/11537311_36openalex-snapshot
Average-Case Non-approximability of Optimisation Problems
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_36openalex-snapshot
Near-optimal dominating sets in dense random graphs in polynomial expected time
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_4openalex-snapshot
Greedily approximating the r-independent set and k-center problems on random instances
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-3-031-48615-9_11openalex-snapshot
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages
inferred← citeshttps://doi.org/10.1007/978-3-032-27574-5_3openalex-snapshot
Eidolon: A Post-Quantum Signature Scheme Based on k-Colorability in the Age of Graph Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_26openalex-snapshot
Algorithm Analysis Through Proof Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-75234-6_15openalex-snapshot
Statistical Mechanics in Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-01069-3_37openalex-snapshot
Probabilistische Analyse am Beispiel des k-Zentrumsproblems
inferred← citeshttps://doi.org/10.1007/bf01019685openalex-snapshot
Application of statistical mechanics to combinatorial optimization problems: The chromatic number problem andq-partitioning of a graph
inferred← citeshttps://doi.org/10.1007/bf02523693openalex-snapshot
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
inferred← citeshttps://doi.org/10.1007/bf02579304openalex-snapshot
Expose-and-merge exploration and the chromatic number of a random graph
inferred← citeshttps://doi.org/10.1007/s00224-007-2012-0openalex-snapshot
Average-Case Non-Approximability of Optimisation Problems
inferred← citeshttps://doi.org/10.1007/s00453-024-01268-7openalex-snapshot
Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs
inferred← citeshttps://doi.org/10.1007/s10479-020-03914-zopenalex-snapshot
The Banzhaf value for generalized probabilistic communication situations
inferred← citeshttps://doi.org/10.1007/s10955-016-1583-zopenalex-snapshot
Generalized Random Sequential Adsorption on Erdős–Rényi Random Graphs
inferred← citeshttps://doi.org/10.1007/s10955-017-1902-zopenalex-snapshot
Scaling Limits and Generic Bounds for Exploration Processes
inferred← citeshttps://doi.org/10.1007/s11432-015-5468-6openalex-snapshot
Efficient link scheduling with joint power control and successive interference cancellation in wireless networks
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90021-1openalex-snapshot
On the order of the largest induced tree in a random graph
inferred← citeshttps://doi.org/10.1016/0304-4149(87)90048-2openalex-snapshot
Poisson convergence and poisson processes with applications to random graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.004openalex-snapshot
The resolution complexity of random graph k-colorability
inferred← citeshttps://doi.org/10.1016/j.spa.2016.10.005openalex-snapshot
The jamming constant of uniform random graphs
inferred← citeshttps://doi.org/10.1017/s0962492919000035openalex-snapshot
Approximation algorithms in combinatorial scientific computing
inferred← citeshttps://doi.org/10.1103/physreve.102.062108openalex-snapshot
Large deviations in one-dimensional random sequential adsorption
inferred← citeshttps://doi.org/10.1109/focs.2019.00078openalex-snapshot
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00007openalex-snapshot
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
inferred← citeshttps://doi.org/10.1109/tc.1983.1676321openalex-snapshot
A Statistical Study of the Performance of a Task Scheduling Algorithm
inferred← citeshttps://doi.org/10.1109/tmc.2004.44openalex-snapshot
Multiple access protocol for power-controlled wireless access nets
inferred← citeshttps://doi.org/10.1109/tvt.2006.883734openalex-snapshot
Optimum Integrated Link Scheduling and Power Control for Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/wimob.2005.1512914openalex-snapshot
Optimum integrated link scheduling and power control for ad hoc wireless networks
inferred← citeshttps://doi.org/10.1137/1.9781611973082.48openalex-snapshot
Algorithms for Implicit Hitting Set Problems
inferred← citeshttps://doi.org/10.1137/20m1316044openalex-snapshot
The Average-Case Complexity of Counting Cliques in Erdoős–Reényi Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1310.8475openalex-snapshot
The Jamming Constant of Uniform Random Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1510.05560openalex-snapshot
The greedy independent set in a random graph with given degrees
inferred← citeshttps://doi.org/10.48550/arxiv.2001.11997openalex-snapshot
Ultimate greedy approximation of independent sets in subcubic graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2009.04945openalex-snapshot
Quasi-cliques in inhomogeneous random graphs
inferred← citeshttps://doi.org/10.70675/28598a09z935cz4b4bz8163z9244bbb8e7feopenalex-snapshot
Parking on random trees
inferred← citeshttps://doi.org/10.70675/cae60fe0z49d9z4c30za6f1z76158ca58aa5openalex-snapshot
Coloration de graphes épars
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.