On the public citation graph
Dynamic Coloring of Graphs
0 signed · 33 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/jgt.20565openalex-snapshot
Vizing's conjecture: a survey and recent results
inferredcites →https://doi.org/10.1002/jgt.3190110205openalex-snapshot
On the equality of the grundy and ochromatic numbers of a graph
inferredcites →https://doi.org/10.1002/jgt.3190120212openalex-snapshot
On‐line and first fit colorings of graphs
inferredcites →https://doi.org/10.1007/978-3-540-68111-3_104openalex-snapshot
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
inferredcites →https://doi.org/10.1016/0095-8956(79)90067-4openalex-snapshot
Some perfect coloring properties of graphs
inferredcites →https://doi.org/10.1016/0377-2217(96)00123-3openalex-snapshot
Scheduling multiprocessor tasks — An overview
inferredcites →https://doi.org/10.1016/j.disc.2009.09.020openalex-snapshot
Grundy number and products of graphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00242-9openalex-snapshot
A new proof of the independence ratio of triangle-free cubic graphs
inferredcites →https://doi.org/10.1016/s0012-365x(96)00359-7openalex-snapshot
On-line 3-chromatic graphs - II critical graphs
inferredcites →https://doi.org/10.1016/s0020-0190(00)00109-5openalex-snapshot
On the performance of the first-fit coloring algorithm on permutation graphs
inferredcites →https://doi.org/10.1023/a:1022908509269openalex-snapshot
Scheduling with Conflicts on Bipartite and Interval Graphs
inferredcites →https://doi.org/10.1137/1.9780898719802openalex-snapshot
Topics in Intersection Graph Theory
inferredcites →https://doi.org/10.1137/s0097539795282092openalex-snapshot
Guaranteeing Fair Service to Persistent Dependent Tasks
inferredcites →https://doi.org/10.1137/s0895480194275825openalex-snapshot
Algorithms for Vertex Partitioning Problems on Partial k-Trees
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-3-319-59605-1_4openalex-snapshot
On Computational Aspects of Greedy Partitioning of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1886-8openalex-snapshot
Dynamic F-free Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/s10878-017-0185-2openalex-snapshot
Computational aspects of greedy partitioning of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.12.011openalex-snapshot
New potential functions for greedy independence and coloring
inferred← citeshttps://doi.org/10.1016/j.disc.2014.12.002openalex-snapshot
Minimum order of graphs with given coloring parameters
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112333openalex-snapshot
Dynamic list coloring of 1-planar graphs
inferred← citeshttps://doi.org/10.1109/asms-spsc.2014.6934570openalex-snapshot
A greedy approach combined with graph coloring for non-uniform beam layouts under antenna constraints in multibeam satellite systems
inferred← citeshttps://doi.org/10.1134/s1990478924020121openalex-snapshot
On the Complexity of the Problem of Choice of Large Clusters
inferred← citeshttps://doi.org/10.23919/wons.2019.8795481openalex-snapshot
A Decentralize Algorithm for Perturbation Minimization in 5G D2D Communication
inferred← citeshttps://doi.org/10.25037/cgantjma.v1i1.2openalex-snapshot
On r-Dynamic Coloring for Graph Operation of Cycle, Star, Complete, and Path
inferred← citeshttps://doi.org/10.3934/math.2022409openalex-snapshot
An improved upper bound for the dynamic list coloring of 1-planar graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.7522openalex-snapshot
Minimum order of graphs with given coloring parameters
inferred← citeshttps://doi.org/10.48550/arxiv.1601.00252openalex-snapshot
Greedy online colouring with buffering
inferred← citeshttps://doi.org/10.7151/dmgt.2533openalex-snapshot
Hypergraph operations preserving sc-greediness
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.