On the public citation graph
Effective on-line coloring ofP 5-free graphs
0 signed · 25 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.3190120212openalex-snapshot
On‐line and first fit colorings of graphs
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.1137/0401048openalex-snapshot
The Linearity of First-Fit Coloring of Interval Graphs
inferredcites →https://doi.org/10.4064/am-19-3-4-413-441openalex-snapshot
Problems from the world surrounding perfect 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/978-0-387-30162-4_264openalex-snapshot
Online Interval Coloring
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-4939-2864-4_264openalex-snapshot
Online Interval Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_264-2openalex-snapshot
Online Interval Coloring
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/s00236-005-0167-1openalex-snapshot
On-line coloring and cliques covering for KKs,t-free graphs
inferred← citeshttps://doi.org/10.1007/s00236-007-0064-xopenalex-snapshot
On-line graph coloring of $${\mathbb{P}_5}$$ -free graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1864-6openalex-snapshot
Star Coloring of Certain Graph Classes
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.dam.2025.08.063openalex-snapshot
Incorporating predictions in online graph coloring algorithms
inferred← citeshttps://doi.org/10.1016/j.endm.2017.11.049openalex-snapshot
On the Grundy number of Cameron graphs
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80051-7openalex-snapshot
Chapter 18 Recursive and on-line graph coloring
inferred← citeshttps://doi.org/10.1137/060668675openalex-snapshot
A New Algorithm for On-line Coloring Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/s0895480191218861openalex-snapshot
On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $
inferred← citeshttps://doi.org/10.1137/s0895480192224737openalex-snapshot
On-Line Coloring and Recursive Graph Theory
inferred← citeshttps://doi.org/10.1137/s089548019631030xopenalex-snapshot
On-Line 3-Chromatic Graphs I. Triangle-Free 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.