On the public citation graph
Legal coloring of graphs
0 signed · 38 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/3-540-10843-2_25openalex-snapshot
Proving lower bounds for linear decision trees
inferredcites →https://doi.org/10.1016/0012-365x(73)90108-8openalex-snapshot
Acyclic orientations of graphs
inferredcites →https://doi.org/10.1016/0022-0000(79)90054-0openalex-snapshot
On the complexity of computations under varying sets of primitives
inferredcites →https://doi.org/10.1080/00029890.1981.11995201openalex-snapshot
The Geometry of Root Systems and Signed Graphs
inferredcites →https://doi.org/10.1090/memo/0154openalex-snapshot
Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
inferredcites →https://doi.org/10.1109/sfcs.1981.47openalex-snapshot
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem
inferredcites →https://doi.org/10.1145/322203.322206openalex-snapshot
Information Bounds Are Weak in the Shortest Distance Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.21739openalex-snapshot
An Extremal Property of Turán Graphs, II
inferred← citeshttps://doi.org/10.1002/jgt.21749openalex-snapshot
Extremal Graphs for Homomorphisms II
inferred← citeshttps://doi.org/10.1002/jgt.21820openalex-snapshot
Extremal H ‐Colorings of Graphs with Fixed Minimum Degree
inferred← citeshttps://doi.org/10.1002/net.20293openalex-snapshot
On the complexity of distributed graph coloring with local minimality constraints
inferred← citeshttps://doi.org/10.1007/s00373-013-1403-zopenalex-snapshot
Counting Colorings of a Regular Graph
inferred← citeshttps://doi.org/10.1007/s00446-016-0269-8openalex-snapshot
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
inferred← citeshttps://doi.org/10.1016/j.disc.2007.04.069openalex-snapshot
Optimal graphs for chromatic polynomials
inferred← citeshttps://doi.org/10.1016/j.disc.2015.12.011openalex-snapshot
Counting dominating sets and related structures in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.010openalex-snapshot
The maximum number of colorings of graphs of given order and size: A survey
inferred← citeshttps://doi.org/10.1016/j.ins.2014.06.035openalex-snapshot
Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.07.002openalex-snapshot
Maximizing proper colorings on graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.10.005openalex-snapshot
A proof of Tomescu's graph coloring conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.01.002openalex-snapshot
Maximum number of colourings: 4-chromatic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114744openalex-snapshot
Resource efficient stabilization for local tasks despite unknown capacity links
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1109/icnc.2014.6975876openalex-snapshot
Led by nature: Distributed leader election in anonymous networks
inferred← citeshttps://doi.org/10.1112/plms/pdp041openalex-snapshot
Maximizing the number of q -colorings
inferred← citeshttps://doi.org/10.1137/0222020openalex-snapshot
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
inferred← citeshttps://doi.org/10.1137/100799745openalex-snapshot
Turán Graphs and the Number of Colorings
inferred← citeshttps://doi.org/10.1142/s0129065715500252openalex-snapshot
Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies
inferred← citeshttps://doi.org/10.1145/100216.100222openalex-snapshot
Optimal randomized algorithms for local sorting and set-maxima
inferred← citeshttps://doi.org/10.13140/2.1.1198.9766openalex-snapshot
Various Results on Enumerations of Graph Homomorphisms
inferred← citeshttps://doi.org/10.48550/arxiv.1205.2718openalex-snapshot
Counting colorings of a regular graph
inferred← citeshttps://doi.org/10.48550/arxiv.1307.5919openalex-snapshot
Extremal H-colorings of graphs with fixed minimum degree
inferred← citeshttps://doi.org/10.48550/arxiv.1406.7872openalex-snapshot
Three tutorial lectures on entropy and counting
inferred← citeshttps://doi.org/10.48550/arxiv.1710.06535openalex-snapshot
Maximum number of colourings. II. 5-chromatic graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1711.04728openalex-snapshot
Cheating by Duplication: Equilibrium Requires Global Knowledge
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.