On the public citation graph

Coloring graphs on-line

0 signed · 66 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/jgt.3190120212openalex-snapshot
On‐line and first fit colorings of graphs
inferredcites →https://doi.org/10.1002/jgt.3190180203openalex-snapshot
Radius two trees specify χ‐bounded classes
inferredcites →https://doi.org/10.1007/bf01206361openalex-snapshot
Effective on-line coloring ofP 5-free graphs
inferredcites →https://doi.org/10.1007/bf01271267openalex-snapshot
On-line coloring of perfect graphs
inferredcites →https://doi.org/10.1007/bf01294263openalex-snapshot
Coloring inductive graphs on-line
inferredcites →https://doi.org/10.1007/bf02020444openalex-snapshot
On chromatic number of graphs and set-systems
inferredcites →https://doi.org/10.1016/0012-365x(80)90230-7openalex-snapshot
Induced subtrees in graphs of large chromatic number
inferredcites →https://doi.org/10.1016/0012-365x(89)90096-4openalex-snapshot
An on-line graph coloring algorithm with sublinear performance ratio
inferredcites →https://doi.org/10.1016/0012-365x(91)90011-popenalex-snapshot
A polynomial time approximation algorithm for dynamic storage allocation
inferredcites →https://doi.org/10.1016/0012-365x(94)00285-qopenalex-snapshot
Coloring interval graphs with first-fit
inferredcites →https://doi.org/10.1016/0095-8956(82)90053-3openalex-snapshot
A Ramsey-type theorem for traceable graphs
inferredcites →https://doi.org/10.1016/0166-218x(94)00062-iopenalex-snapshot
On-line algorithms for ordered sets and comparability graphs
inferredcites →https://doi.org/10.1016/0196-6774(92)90061-gopenalex-snapshot
Randomized online graph coloring
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/s0304-3975(96)00204-6openalex-snapshot
On-line chain partitions of orders
inferredcites →https://doi.org/10.1017/s0022481200051549openalex-snapshot
Effective coloration
inferredcites →https://doi.org/10.1051/ita/1988220404871openalex-snapshot
On some packing problem related to dynamic storage allocation
inferredcites →https://doi.org/10.1090/s0002-9939-1983-0691291-0openalex-snapshot
An Effective Version of Hall's Theorem
inferredcites →https://doi.org/10.1090/s0002-9947-1981-0628446-xopenalex-snapshot
An Effective Version of Dilworth's Theorem
inferredcites →https://doi.org/10.1112/plms/s3-25.4.615openalex-snapshot
Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
inferredcites →https://doi.org/10.1137/0401048openalex-snapshot
The Linearity of First-Fit Coloring of Interval Graphs
inferredcites →https://doi.org/10.1137/s0895480191218861openalex-snapshot
On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
inferredcites →https://doi.org/10.1137/s0895480192224737openalex-snapshot
On-Line Coloring and Recursive Graph Theory
inferredcites →https://doi.org/10.4064/am-19-3-4-413-441openalex-snapshot
Problems from the world surrounding perfect graphs
inferredcites →https://doi.org/10.4153/cjm-1980-062-7openalex-snapshot
Recursive Colorings of Graphs
inferredcites →https://doi.org/10.4153/cjm-1981-097-8openalex-snapshot
Recursive Colorings of Highly Recursive Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.200910108openalex-snapshot
Reverse Mathematics and Grundy colorings of graphs
inferred← citeshttps://doi.org/10.1007/11758471_28openalex-snapshot
On-Line Coloring of H-Free Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/11841036_34openalex-snapshot
Graph Coloring with Rejection
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_4openalex-snapshot
Online Coloring and a New Type of Adversary for Online Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-60924-4_22openalex-snapshot
Online Graph Coloring with Predictions
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-319-18263-6_16openalex-snapshot
Online Dual Edge Coloring of Paths and Trees
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/978-3-540-24592-6_1openalex-snapshot
Online Coloring of Intervals with Bandwidth
inferred← citeshttps://doi.org/10.1007/978-3-540-68111-3_104openalex-snapshot
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
inferred← citeshttps://doi.org/10.1007/978-3-540-77918-6_16openalex-snapshot
On the Online Unit Clustering Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13182-0_22openalex-snapshot
Obtaining Online Ecological Colourings by Generalizing First-Fit
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_2openalex-snapshot
Open Problems on Graph Coloring for Special Graph Classes
inferred← citeshttps://doi.org/10.1007/s00224-013-9513-9openalex-snapshot
Obtaining Online Ecological Colourings by Generalizing First-Fit
inferred← citeshttps://doi.org/10.1007/s00236-016-0283-0openalex-snapshot
Online edge coloring of paths and trees with a fixed number of colors
inferred← citeshttps://doi.org/10.1007/s00373-019-02125-zopenalex-snapshot
Online Coloring a Token Graph
inferred← citeshttps://doi.org/10.1007/s00453-020-00759-7openalex-snapshot
Tight Bounds for Online Coloring of Basic Graph Classes
inferred← citeshttps://doi.org/10.1007/s00453-021-00920-wopenalex-snapshot
Online Coloring and a New Type of Adversary for Online Graph Problems
inferred← citeshttps://doi.org/10.1007/s10107-003-0436-0openalex-snapshot
Online algorithms: a survey
inferred← citeshttps://doi.org/10.1007/s10878-017-0185-2openalex-snapshot
Computational aspects of greedy partitioning of graphs
inferred← citeshttps://doi.org/10.1007/s11083-011-9197-1openalex-snapshot
On-Line Chain Partitions of Orders: A Survey
inferred← citeshttps://doi.org/10.1016/j.dam.2007.07.002openalex-snapshot
Inequalities for the Grundy chromatic number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.009openalex-snapshot
First-Fit coloring of {P5,K4−e} -free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.06.044openalex-snapshot
Results on the Grundy chromatic number of graphs
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.ipl.2008.08.009openalex-snapshot
Online hypergraph coloring
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.016openalex-snapshot
Graph coloring with rejection
inferred← citeshttps://doi.org/10.1016/j.orl.2009.12.005openalex-snapshot
Online coloring graphs with high girth and high odd girth
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.046openalex-snapshot
Online unit clustering: Variations on a theme
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00109-5openalex-snapshot
On the performance of the first-fit coloring algorithm on permutation graphs
inferred← citeshttps://doi.org/10.1017/9781316755846.021openalex-snapshot
Reverse mathematics and graph coloring: eliminating diagonalization
inferred← citeshttps://doi.org/10.1017/cbo9780511662119.009openalex-snapshot
New Perspectives on Interval Orders and Interval Graphs
inferred← citeshttps://doi.org/10.1109/cloud53861.2021.00080openalex-snapshot
Rightsizing Clusters for Time-Limited Tasks
inferred← citeshttps://doi.org/10.1137/060668675openalex-snapshot
A New Algorithm for On-line Coloring Bipartite Graphs
inferred← citeshttps://doi.org/10.1145/1868237.1868245openalex-snapshot
On the online unit clustering problem
inferred← citeshttps://doi.org/10.1145/2993749.2993766openalex-snapshot
Online Algorithms with Advice: A Survey
inferred← citeshttps://doi.org/10.3233/fi-2012-620openalex-snapshot
Dynamic Coloring of Graphs
inferred← citeshttps://doi.org/10.4230/lipics.esa.2016.37openalex-snapshot
On the Power of Advice and Randomization for Online Bipartite Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3817openalex-snapshot
Online Edge Coloring of Paths and Trees with a Fixed Number of Colors
inferred← citeshttps://doi.org/10.7151/dmgt.1331openalex-snapshot
On-line P-coloring of graphs
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.