On the public citation graph
The chromatic number of random graphs
0 signed · 343 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.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/bf02579208openalex-snapshot
Sharp concentration of the chromatic number on random graphsG n, p
inferredcites →https://doi.org/10.1007/bf02579304openalex-snapshot
Expose-and-merge exploration and the chromatic number of a random graph
inferredcites →https://doi.org/10.1007/bf02761909openalex-snapshot
Random embeddings of Euclidean spaces in sequence spaces
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/s0304-0208(08)73612-0openalex-snapshot
Random Graphs of Small Order
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0684503-5openalex-snapshot
On the dimension of the 𝑙ⁿ_{𝑝}-subspaces of Banach spaces, for 1≤𝑝<2
inferredcites →https://doi.org/10.1214/aop/1176996452openalex-snapshot
On Tail Probabilities for Martingales
inferredcites →https://doi.org/10.2307/1999427openalex-snapshot
On the Dimension of the l n p -Subspaces of Banach Spaces, for 1 p < 2
inferredcites →https://doi.org/10.2748/tmj/1178243286openalex-snapshot
Weighted sums of certain dependent random variables
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4778361openalex-extracted
Rejali's Conjecture on Limiting Distribution of the Chromatic Number of a Random Graph
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199705)25:1<3::aid-jgt1>3.3.co;2-vopenalex-snapshot
Open problems of Paul Erdos in graph theory
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199907)31:3<201::aid-jgt5>3.0.co;2-topenalex-snapshot
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
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/(sici)1098-2418(199807)12:4<381::aid-rsa5>3.0.co;2-popenalex-snapshot
The chromatic numbers of random hypergraphs
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(1999010)14:1<63::aid-rsa3>3.0.co;2-7openalex-snapshot
A Sharp Threshold fork-Colorability
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0146openalex-snapshot
Maximum Clique, Maximum Independent Set, and Graph Coloring Problems
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/jgt.20341openalex-snapshot
Triangulations and the Hajós conjecture
inferred← citeshttps://doi.org/10.1002/jgt.22571openalex-snapshot
Fractional chromatic number of a random subgraph
inferred← citeshttps://doi.org/10.1002/jgt.22927openalex-snapshot
Tight asymptotics of clique‐chromatic numbers of dense random graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190150604openalex-snapshot
Some extremal results in cochromatic and dichromatic theory
inferred← citeshttps://doi.org/10.1002/rsa.10003openalex-snapshot
Random lifts of graphs: Independence and chromatic number
inferred← citeshttps://doi.org/10.1002/rsa.10063openalex-snapshot
On the probability of independent sets in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.10112openalex-snapshot
Adding random edges to dense graphs
inferred← citeshttps://doi.org/10.1002/rsa.1013openalex-snapshot
Random regular graphs of high degree
inferred← citeshttps://doi.org/10.1002/rsa.20096openalex-snapshot
MAXk‐CUT and approximating the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20179openalex-snapshot
The game chromatic number of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20264openalex-snapshot
Equitable coloring of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20488openalex-snapshot
For most graphsH, mostH‐free graphs have a linear homogeneous set
inferred← citeshttps://doi.org/10.1002/rsa.20757openalex-snapshot
The chromatic number of dense random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20824openalex-snapshot
Hypergraph coloring up to condensation
inferred← citeshttps://doi.org/10.1002/rsa.20884openalex-snapshot
Disproof of a packing conjecture of Alon and Spencer
inferred← citeshttps://doi.org/10.1002/rsa.21078openalex-snapshot
The largest hole in sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240010404openalex-snapshot
On the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240040403openalex-snapshot
Ramsey properties of orientations of graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240060222openalex-snapshot
Generalized chromatic numbers of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.70014openalex-snapshot
The Clique Chromatic Number of Sparse Random Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1996.0827openalex-snapshot
On-Line Coloring of Sparse Random Graphs and Random Trees
inferred← citeshttps://doi.org/10.1006/jcta.1996.0001openalex-snapshot
Asymptotically Good List-Colorings
inferred← citeshttps://doi.org/10.1006/jctb.2001.2053openalex-snapshot
Choosability in Random Hypergraphs
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_2openalex-snapshot
Discrete Mathematics and Radio Channel Assignment
inferred← citeshttps://doi.org/10.1007/11537311_36openalex-snapshot
Average-Case Non-approximability of Optimisation Problems
inferred← citeshttps://doi.org/10.1007/11941439_78openalex-snapshot
Solving a Constraint Satisfaction Problem for Frequency Assignment in Low Power FM Broadcasting
inferred← citeshttps://doi.org/10.1007/3-540-44666-4_31openalex-snapshot
Equitable Coloring Extends Chernoff-Hoeffding Bounds
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_3openalex-snapshot
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
inferred← citeshttps://doi.org/10.1007/3-540-45506-x_8openalex-snapshot
Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_247openalex-snapshot
On quadratic lattice approximations
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_50openalex-snapshot
Coloring k-colorable graphs in constant expected parallel time
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-1-4614-7258-2_23openalex-snapshot
The Origins of the Theory of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81054-2_3openalex-snapshot
Bounds and Constructive Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_8openalex-snapshot
The Largest Hole in Sparse Random Graphs
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-0348-8211-8_11openalex-snapshot
Coloring Random Graphs — an Algorithmic Perspective
inferred← citeshttps://doi.org/10.1007/978-3-0348-8974-2_1openalex-snapshot
Randomness and Pseudo-Randomness in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-319-51753-7_8openalex-snapshot
On-Line List Colouring of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-72089-0_2openalex-snapshot
Disproving the Conjectures from “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model”
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_11openalex-snapshot
Why Almost All k-Colorable Graphs Are Easy
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_67openalex-snapshot
On the Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_19openalex-snapshot
A Game Theoretic Approach for Efficient Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-01244-0_33openalex-snapshot
A Probabilistic Bound on the Basic Role Mining Problem and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_11openalex-snapshot
Approximability Distance in the Space of H-Colourability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_51openalex-snapshot
Colouring Non-sparse Random Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_24openalex-snapshot
Approximating the Minimum Independent Dominating Set in Perturbed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-60408-9_24openalex-snapshot
The Origins of the Theory of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_2openalex-snapshot
Probabilistic Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-43936-4_8openalex-snapshot
Toward Software Diversity in Heterogeneous Networked Systems
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_11openalex-snapshot
Probabilistic Analysis of Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_17openalex-snapshot
Two notions of unit distance graphs
inferred← citeshttps://doi.org/10.1007/bf01202786openalex-snapshot
Clique coverings of the edges of a random graph
inferred← citeshttps://doi.org/10.1007/bf01215914openalex-snapshot
The concentration of the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/bf01375472openalex-snapshot
The chromatic number of random graphs
inferred← citeshttps://doi.org/10.1007/bf02699376openalex-snapshot
Concentration of measure and isoperimetric inequalities in product spaces
inferred← citeshttps://doi.org/10.1007/s00224-009-9231-5openalex-snapshot
Why Almost All k-Colorable Graphs Are Easy to Color
inferred← citeshttps://doi.org/10.1007/s00224-016-9733-xopenalex-snapshot
On the Chromatic Number of Non-Sparse Random Intersection Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02463-5openalex-snapshot
Fractional Cocoloring of Graphs
inferred← citeshttps://doi.org/10.1007/s00493-013-2853-xopenalex-snapshot
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
inferred← citeshttps://doi.org/10.1007/s00493-016-3394-xopenalex-snapshot
Local Convergence of Random Graph Colorings
inferred← citeshttps://doi.org/10.1007/s00493-021-4236-zopenalex-snapshot
Lower Bounds on the Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1007/s00493-025-00188-6openalex-snapshot
Clique packings in random graphs
inferred← citeshttps://doi.org/10.1007/s00493-025-00190-yopenalex-snapshot
The Largest Subgraph Without A Forbidden Induced Subgraph
inferred← citeshttps://doi.org/10.1007/s004930070019openalex-snapshot
The Structure of Hereditary Properties and Colourings of Random Graphs
inferred← citeshttps://doi.org/10.1007/s004939970001openalex-snapshot
List Coloring of Random and Pseudo-Random Graphs
inferred← citeshttps://doi.org/10.1007/s00500-017-2861-7openalex-snapshot
Uncertain vertex coloring problem
inferred← citeshttps://doi.org/10.1007/s10255-025-0002-0openalex-snapshot
Some New Results on Majority Coloring of Digraphs
inferred← citeshttps://doi.org/10.1007/s10732-018-9393-xopenalex-snapshot
Implementation of a maximum clique search procedure on CUDA
inferred← citeshttps://doi.org/10.1007/s10958-007-0388-7openalex-snapshot
Colorings of spaces, and random graphs
inferred← citeshttps://doi.org/10.1007/s10958-015-2330-8openalex-snapshot
Colorings of Partial Steiner Systems and Their Applications
inferred← citeshttps://doi.org/10.1007/s10958-023-06663-zopenalex-snapshot
Experimental Study of Semi-Supervised Graph 2-Clustering Problem
inferred← citeshttps://doi.org/10.1007/s11036-009-0213-2openalex-snapshot
The Maximum Throughput of A Wireless Multi-Hop Path
inferred← citeshttps://doi.org/10.1007/s11227-020-03439-zopenalex-snapshot
Interval graph multi-coloring-based resource reservation for energy-efficient containerized cloud data centers
inferred← citeshttps://doi.org/10.1007/s11856-019-1945-8openalex-snapshot
The minrank of random graphs over arbitrary fields
inferred← citeshttps://doi.org/10.1007/s13171-020-00205-4openalex-snapshot
Cliques and Chromatic Number in Multiregime Random Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90050-ropenalex-snapshot
On the interval number of random graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90149-copenalex-snapshot
On the independence number of random graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90057-zopenalex-snapshot
The total interval number of a graph, I: Fundamental classes
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90070-eopenalex-snapshot
On the independence and chromatic numbers of random regular graphs
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90022-9openalex-snapshot
Isoperimetric inequalities and fractional set systems
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90046-yopenalex-snapshot
Lattice bandwidth of random graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90237-iopenalex-snapshot
Excluding induced subgraphs II: extremal graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00103-kopenalex-snapshot
Expected complexity of graph partitioning problems
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90035-7openalex-snapshot
Parallei graph algorithms that are efficient on average
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50008-7openalex-snapshot
10.1016/b978-044488002-4/50008-7
inferred← citeshttps://doi.org/10.1016/j.aim.2003.10.007openalex-snapshot
Sandwiching random graphs: universality between random graph models
inferred← citeshttps://doi.org/10.1016/j.aim.2009.08.006openalex-snapshot
On the chromatic number of random d-regular graphs
inferred← citeshttps://doi.org/10.1016/j.aim.2018.05.029openalex-snapshot
Information-theoretic thresholds from the cavity method
inferred← citeshttps://doi.org/10.1016/j.chaos.2021.110745openalex-snapshot
Multifractal analysis of eigenvectors of small-world networks
inferred← citeshttps://doi.org/10.1016/j.cor.2020.105024openalex-snapshot
The stable set problem: Clique and nodal inequalities revisited
inferred← citeshttps://doi.org/10.1016/j.dam.2019.07.002openalex-snapshot
On the chromatic number of random subgraphs of a certain distance graph
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.031openalex-snapshot
Estimating the r -colorability threshold for a random hypergraph
inferred← citeshttps://doi.org/10.1016/j.dam.2020.04.035openalex-snapshot
On the independence number and the chromatic number of generalized preferential attachment models
inferred← citeshttps://doi.org/10.1016/j.disc.2003.09.009openalex-snapshot
Bounding the strong chromatic index of dense random graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.061openalex-snapshot
Some results on (a:b) -choosability
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.019openalex-snapshot
A note on the chromatic number of a dense random graph
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.014openalex-snapshot
Random regular graphs of non-constant degree: Concentration of the chromatic number
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.024openalex-snapshot
Hadwiger numbers and over-dominating colourings
inferred← citeshttps://doi.org/10.1016/j.disc.2012.07.001openalex-snapshot
Indicated coloring of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.09.007openalex-snapshot
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number
inferred← citeshttps://doi.org/10.1016/j.disc.2018.01.001openalex-snapshot
Online sum-paintability: The slow-coloring game
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112231openalex-snapshot
On the strong chromatic number of a random 3-uniform hypergraph
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114422openalex-snapshot
Box complexes: At the crossroad of graph theory and topology
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.07.016openalex-snapshot
Acyclic subgraphs with high chromatic number
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103064openalex-snapshot
Dold’s theorem from viewpoint of strong compatibility graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103324openalex-snapshot
The eternal game chromatic number of random graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103365openalex-snapshot
On the chromatic number of the preferential attachment graph
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104323openalex-snapshot
Acyclic subgraphs of digraphs with high chromatic number
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.067openalex-snapshot
The t-improper chromatic number of random graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.107openalex-snapshot
On the Plane-Width of Graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.004openalex-snapshot
An improved algorithm for approximating the chromatic number of
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.04.011openalex-snapshot
On the tractability of coloring semirandom graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.06.003openalex-snapshot
Average-case complexity of backtrack search for coloring sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.02.006openalex-snapshot
Two notions of unit distance graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.11.009openalex-snapshot
On the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.09.006openalex-snapshot
On the chromatic number of random regular graphs
inferred← citeshttps://doi.org/10.1016/j.physa.2015.09.029openalex-snapshot
Topological properties and community detection of venture capital network: Evidence from China
inferred← citeshttps://doi.org/10.1016/j.rinam.2025.100600openalex-snapshot
Chromatic number of random graphs: An approach using a recurrence relation
inferred← citeshttps://doi.org/10.1016/j.sysarc.2005.02.001openalex-snapshot
Time-constrained scheduling of large pipelined datapaths
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.010openalex-snapshot
Approximating the minimum independent dominating set in perturbed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.015openalex-snapshot
A dichotomy theorem for circular colouring reconfiguration
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.023openalex-snapshot
Graph clustering via generalized colorings
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00187-9openalex-snapshot
Deciding k-colorability in expected polynomial time
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70393-5openalex-snapshot
Some Problems and Results in Cochromatic Theory
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70399-6openalex-snapshot
Quo Vadis, Random Graph Theory?
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80123-0openalex-snapshot
Chromatic Number Versus Cochromatic Number in Graphs with Bounded Clique Number
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00032-9openalex-snapshot
The probability method: Successes and limitations
inferred← citeshttps://doi.org/10.1017/9781108332699.009openalex-snapshot
Robustness of graph properties
inferred← citeshttps://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/fms.2023.6openalex-snapshot
Ramsey numbers of cycles versus general graphs
inferred← citeshttps://doi.org/10.1017/s0963548300000122openalex-snapshot
Choice Numbers of Graphs: a Probabilistic Approach
inferred← citeshttps://doi.org/10.1017/s0963548306007917openalex-snapshot
Colouring Semirandom Graphs
inferred← citeshttps://doi.org/10.1017/s0963548306008388openalex-snapshot
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
inferred← citeshttps://doi.org/10.1017/s0963548309990216openalex-snapshot
The t-Improper Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.1017/s0963548315000103openalex-snapshot
On the Method of Typical Bounded Differences
inferred← citeshttps://doi.org/10.1017/s0963548316000304openalex-snapshot
On the Chromatic Number of Random Cayley Graphs
inferred← citeshttps://doi.org/10.1017/s0963548316000390openalex-snapshot
Planting Colourings Silently
inferred← citeshttps://doi.org/10.1017/s0963548318000251openalex-snapshot
On the Number of Solutions in Random Graphk-Colouring
inferred← citeshttps://doi.org/10.1017/s0963548319000026openalex-snapshot
Separation Choosability and Dense Bipartite Induced Subgraphs
inferred← citeshttps://doi.org/10.1017/s0963548319000397openalex-snapshot
Sharp concentration of the equitable chromatic number of dense random graphs
inferred← citeshttps://doi.org/10.1017/s0963548321000353openalex-snapshot
On the edit distance function of the random graph
inferred← citeshttps://doi.org/10.1017/s0963548399004101openalex-snapshot
The Choice Number of Dense Random Graphs
inferred← citeshttps://doi.org/10.1023/a:1013899527204openalex-snapshot
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601815openalex-snapshot
A polynomially searchable exponential neighbourhood for graph colouring
inferred← citeshttps://doi.org/10.1063/1.4940819openalex-snapshot
An α-cut chromatic number of a total uncertain graph and its properties
inferred← citeshttps://doi.org/10.1070/sm2005v196n01abeh000874openalex-snapshot
The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
inferred← citeshttps://doi.org/10.1070/sm2015v206n10abeh004498openalex-snapshot
Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
inferred← citeshttps://doi.org/10.1080/02331939008843629openalex-snapshot
Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck
inferred← citeshttps://doi.org/10.1088/1751-8113/43/17/175002openalex-snapshot
Chromatic polynomials of random graphs
inferred← citeshttps://doi.org/10.1090/jams/957openalex-snapshot
Non-concentration of the chromatic number of a random graph
inferred← citeshttps://doi.org/10.1090/memo/1274openalex-snapshot
The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
inferred← citeshttps://doi.org/10.1093/imrn/rnv333openalex-snapshot
The Chromatic Number of Random Graphs for Most Average Degrees
inferred← citeshttps://doi.org/10.1098/rsos.181286openalex-snapshot
Chromatic transitions in the emergence of syntax networks
inferred← citeshttps://doi.org/10.1103/physreva.101.062322openalex-snapshot
Measurement reduction in variational quantum algorithms
inferred← citeshttps://doi.org/10.1103/physreva.106.042443openalex-snapshot
Optimization of variational-quantum-eigensolver measurement by partitioning Pauli operators using multiqubit Clifford gates on noisy intermediate-scale quantum hardware
inferred← citeshttps://doi.org/10.1103/physreve.109.014218openalex-snapshot
Exploring universality of the β−Gaussian ensemble in complex networks via intermediate eigenvalue statistics
inferred← citeshttps://doi.org/10.1108/cpe-05-2020-0005openalex-snapshot
A political–economic explanation of “internet space”
inferred← citeshttps://doi.org/10.1109/access.2019.2913860openalex-snapshot
Opportunistic Network Coding-Assisted Cloud Offloading in Heterogeneous Fog Radio Access Networks
inferred← citeshttps://doi.org/10.1109/ccnc.2012.6180958openalex-snapshot
A time-slot and channel assignment algorithm in OFDM/TDMA wireless mesh networks
inferred← citeshttps://doi.org/10.1109/dac.1997.597129openalex-snapshot
Exact Coloring Of Real-life Graphs Is Easy
inferred← citeshttps://doi.org/10.1109/focs.2008.61openalex-snapshot
k-Wise Independent Random Graphs
inferred← citeshttps://doi.org/10.1109/focs.2013.48openalex-snapshot
Chasing the K-Colorability Threshold
inferred← citeshttps://doi.org/10.1109/icppw.2004.1328046openalex-snapshot
Performance evaluation of heuristic algorithms for wavelength assignment in WDM optical networks
inferred← citeshttps://doi.org/10.1109/icppw.2004.71openalex-snapshot
Performance evaluation of heuristic algorithms for wavelength assignment in WDM optical networks
inferred← citeshttps://doi.org/10.1109/isit.2009.5205995openalex-snapshot
Adaptive network coded retransmission scheme for wireless multicast
inferred← citeshttps://doi.org/10.1109/isit.2012.6283850openalex-snapshot
On linear index coding for random graphs
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619651openalex-snapshot
An Extension of Mcdiarmid's Inequality
inferred← citeshttps://doi.org/10.1109/seeda-cecnsm49515.2020.9221815openalex-snapshot
One Dimensional Cross-Correlation Methods For Deterministic And Stochastic Graph Signals With A Twitter Application In Julia
inferred← citeshttps://doi.org/10.1109/synasc.2010.61openalex-snapshot
Improved Bounds on the Complexity of Graph Coloring
inferred← citeshttps://doi.org/10.1109/tc.2010.204openalex-snapshot
Maximizing Spare Utilization by Virtually Reorganizing Faulty Cache Lines
showing the first 200 of 330 · page through all 330
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.