On the public citation graph

Combinatorial Coloring of 3-Colorable Graphs

0 signed · 32 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/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-11120-4_3openalex-snapshot
Computational Complexity of Combinatorial and Graph-Theoretic Problems
inferredcites →https://doi.org/10.1007/bf01840398openalex-snapshot
A better performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1007/s004930070013openalex-snapshot
On the Hardness of Approximating the Chromatic Number
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/s0020-0190(96)00190-1openalex-snapshot
An algorithm for 3-colorable graphs
inferredcites →https://doi.org/10.1109/focs.2007.13openalex-snapshot
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
inferredcites →https://doi.org/10.1109/focs.2007.72openalex-snapshot
Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
inferredcites →https://doi.org/10.1109/sfcs.1994.365707openalex-snapshot
A note on the θ number of Lovasz and the generalized Delsarte bound
inferredcites →https://doi.org/10.1109/sfcs.2002.1181951openalex-snapshot
Graphs with tiny vector chromatic numbers and huge chromatic numbers
inferredcites →https://doi.org/10.1137/07068062xopenalex-snapshot
Conditional Hardness for Approximate Coloring
inferredcites →https://doi.org/10.1137/s0895480100376794openalex-snapshot
On the Hardness of 4-Coloring a 3-Colorable Graph
inferredcites →https://doi.org/10.1145/1132516.1132548openalex-snapshot
New approximation guarantee for chromatic number
inferredcites →https://doi.org/10.1145/1502793.1502794openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/176584.176586openalex-snapshot
New approximation algorithms for graph coloring
inferredcites →https://doi.org/10.1145/2157.2158openalex-snapshot
Improving the performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/274787.274791openalex-snapshot
Approximate graph coloring by semidefinite programming

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-4939-2864-4_170openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_170-2openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_17openalex-snapshot
Improved Hardness of Approximating Chromatic Number
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.016openalex-snapshot
Graph colouring algorithms
inferred← citeshttps://doi.org/10.1109/ccc.2014.16openalex-snapshot
Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs
inferred← citeshttps://doi.org/10.1109/focs.2014.30openalex-snapshot
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors
inferred← citeshttps://doi.org/10.1145/2422436.2422495openalex-snapshot
H-wise independence
inferred← citeshttps://doi.org/10.1145/3001582openalex-snapshot
Coloring 3-Colorable Graphs with Less than n 1/5 Colors
inferred← citeshttps://doi.org/10.1201/b16132-20openalex-snapshot
Connectivity
inferred← citeshttps://doi.org/10.1201/b16132-30openalex-snapshot
Further Topics in Graph Coloring
inferred← citeshttps://doi.org/10.4086/cjtcs.2019.003openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.28openalex-snapshot
Approximation Algorithms for Partially Colorable Graphs
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2014.458openalex-snapshot
Coloring 3-colorable graphs with o(n^{1/5}) colors
inferred← citeshttps://doi.org/10.5555/2634074.2634191openalex-snapshot
Hardness of finding independent sets in 2-colorable and almost 2-colorable hypergraphs
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.