On the public citation graph
Mr. Paint and Mrs. Correct
0 signed · 95 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.1006/jctb.1994.1062openalex-snapshot
Every Planar Graph Is 5-Choosable
inferredcites →https://doi.org/10.1006/jctb.1995.1011openalex-snapshot
The List Chromatic Index of a Bipartite Multigraph
inferredcites →https://doi.org/10.1006/jctb.1997.1780openalex-snapshot
List Edge and List Total Colourings of Multigraphs
inferredcites →https://doi.org/10.1007/bf01204715openalex-snapshot
Colorings and orientations of graphs
inferredcites →https://doi.org/10.1016/0012-365x(92)90602-copenalex-snapshot
List edge chromatic number of graphs with large girth
inferredcites →https://doi.org/10.1016/s0012-365x(98)00197-6openalex-snapshot
A bound for the game chromatic number of graphs
inferredcites →https://doi.org/10.1017/cbo9780511662089openalex-snapshot
Surveys in Combinatorics, 1993
inferredcites →https://doi.org/10.1017/cbo9780511662089.002openalex-snapshot
Restricted colorings of graphs
inferredcites →https://doi.org/10.1017/s0963548398003411openalex-snapshot
Combinatorial Nullstellensatz
inferredcites →https://doi.org/10.1090/dimacs/049/13openalex-snapshot
New trends in the theory of graph colorings: Choosability and list coloring
inferredcites →https://doi.org/10.37236/285openalex-snapshot
Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants
inferredcites →https://doi.org/10.37236/448openalex-snapshot
A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of $k$-partite $k$-uniform Hypergraphs
inferredcites →https://doi.org/10.37236/734openalex-snapshot
Algebraically Solvable Problems: Describing Polynomials as Equivalent to Explicit Solutions
inferredcites →https://doi.org/10.7151/dmgt.1049openalex-snapshot
Graph colorings with local constraints -- a survey
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.21714openalex-snapshot
Partial Online List Coloring of Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22128openalex-snapshot
Extracting List Colorings from Large Independent Sets
inferred← citeshttps://doi.org/10.1002/jgt.22718openalex-snapshot
Chromatic λ‐choosable and λ‐paintable graphs
inferred← citeshttps://doi.org/10.1002/jgt.23047openalex-snapshot
The Alon–Tarsi number of planar graphs revisited
inferred← citeshttps://doi.org/10.1002/jgt.23214openalex-snapshot
The Polynomial Method for Three‐Path Extendability of List Colourings of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-29516-9_11openalex-snapshot
List Colouring and Partial List Colouring of Graphs On-line
inferred← citeshttps://doi.org/10.1007/978-3-319-51753-7_8openalex-snapshot
On-Line List Colouring of Random Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1441-1openalex-snapshot
Sum-Paintability of Generalized Theta-Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1495-0openalex-snapshot
Families of Online Sum-Choice-Greedy Graphs
inferred← citeshttps://doi.org/10.1007/s00373-020-02215-3openalex-snapshot
An Infinite Family of Sum-Paint Critical Graphs
inferred← citeshttps://doi.org/10.1007/s00493-016-3584-6openalex-snapshot
Edge Lower Bounds for List Critical Graphs, Via Discharging
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.004openalex-snapshot
Indicated coloring of matroids
inferred← citeshttps://doi.org/10.1016/j.dam.2015.12.014openalex-snapshot
List rankings and on-line list rankings of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.08.002openalex-snapshot
On-line list coloring of matroids
inferred← citeshttps://doi.org/10.1016/j.dam.2017.02.008openalex-snapshot
Choosability and paintability of the lexicographic product of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.09.013openalex-snapshot
Dynamic coloring parameters for graphs with given genus
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.003openalex-snapshot
Online sum-paintability: Slow-coloring of trees
inferred← citeshttps://doi.org/10.1016/j.dam.2020.04.005openalex-snapshot
The generalized matcher game
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.009openalex-snapshot
On-line DP-coloring of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.008openalex-snapshot
Every planar graph is 1-defective (9,2) -paintable
inferred← citeshttps://doi.org/10.1016/j.dam.2022.02.006openalex-snapshot
Graph polynomials and paintability of plane graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.12.001openalex-snapshot
Slow coloring of 3k -connected graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.010openalex-snapshot
Paintability of Complete Bipartite Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.001openalex-snapshot
Degree-truncated Alon–Tarsi number of outerplanar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.07.019openalex-snapshot
Brooks’ Theorem via the Alon–Tarsi Theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2012.07.035openalex-snapshot
Critically paintable, choosable or colorable graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.022openalex-snapshot
The list-chromatic index of K6
inferred← citeshttps://doi.org/10.1016/j.disc.2014.01.024openalex-snapshot
Brooks’ theorem on powers of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.11.015openalex-snapshot
Locally planar graphs are 5-paintable
inferred← citeshttps://doi.org/10.1016/j.disc.2017.11.012openalex-snapshot
The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
inferred← citeshttps://doi.org/10.1016/j.disc.2017.11.022openalex-snapshot
List colouring of graphs and generalized Dyck paths
inferred← citeshttps://doi.org/10.1016/j.disc.2018.01.001openalex-snapshot
Online sum-paintability: The slow-coloring game
inferred← citeshttps://doi.org/10.1016/j.disc.2018.07.020openalex-snapshot
3-dynamic coloring of planar triangulations
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114076openalex-snapshot
Toroidal graphs without K5− and 6-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114558openalex-snapshot
Paintability of r-chromatic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114577openalex-snapshot
Mrs. Correct and majority colorings
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.020openalex-snapshot
Application of polynomial method to on-line list colouring of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.07.003openalex-snapshot
Towards an on-line version of Ohba’s conjecture
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.12.004openalex-snapshot
Locally planar graphs are 2-defective 4-paintable
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.05.001openalex-snapshot
On the choice number of complete multipartite graphs with part size four
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.07.003openalex-snapshot
Bounds on the game transversal number in hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103505openalex-snapshot
Graph polynomials and group coloring of graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.04.056openalex-snapshot
The tournament scheduling problem with absences
inferred← citeshttps://doi.org/10.1016/j.endm.2013.07.015openalex-snapshot
Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.06.009openalex-snapshot
Bounds on partial online list colouring
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.12.007openalex-snapshot
On two generalizations of the Alon–Tarsi polynomial method
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.06.004openalex-snapshot
The Alon–Tarsi number of planar graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.05.004openalex-snapshot
Improved lower bounds on the number of edges in list critical and online list critical graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.02.005openalex-snapshot
The Alon-Tarsi number of a planar graph minus a matching
inferred← citeshttps://doi.org/10.1016/j.jda.2018.11.014openalex-snapshot
Computing the list chromatic index of graphs
inferred← citeshttps://doi.org/10.1051/ro/2023162openalex-snapshot
Bichromatic coloring game on triangulations
inferred← citeshttps://doi.org/10.1137/120884742openalex-snapshot
Extremal Problems for Game Domination Number
inferred← citeshttps://doi.org/10.1137/140976935openalex-snapshot
Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
inferred← citeshttps://doi.org/10.1137/15m1049361openalex-snapshot
Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
inferred← citeshttps://doi.org/10.1137/15m1051774openalex-snapshot
List-Coloring Claw-Free Graphs with $\Delta-1$ Colors
inferred← citeshttps://doi.org/10.1142/s1793830918500672openalex-snapshot
3-Paintability of planar graphs
inferred← citeshttps://doi.org/10.11650/twjm/1500406598openalex-snapshot
ON-LINE 3-CHOOSABLE PLANAR GRAPHS
inferred← citeshttps://doi.org/10.12677/orf.2018.82005openalex-snapshot
On-Line 4-Choosable Planar Graphs
inferred← citeshttps://doi.org/10.12677/orf.2018.82006openalex-snapshot
Online List Colouring of Graphs with Crossing Number
inferred← citeshttps://doi.org/10.12958/adm1806openalex-snapshot
Online list coloring for signed graphs
inferred← citeshttps://doi.org/10.22049/cco.2019.26437.1110openalex-snapshot
Paired-Domination Game Played in Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.2398.7d5openalex-snapshot
The polynomial method for list-colouring extendability of outerplanar graphs
inferred← citeshttps://doi.org/10.37236/285openalex-snapshot
Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants
inferred← citeshttps://doi.org/10.37236/3378openalex-snapshot
On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach
inferred← citeshttps://doi.org/10.37236/3876openalex-snapshot
Characterization of $(2m,m)$-Paintable Graphs
inferred← citeshttps://doi.org/10.37236/4084openalex-snapshot
Proof of the List Edge Coloring Conjecture for Complete Graphs of Prime Degree
inferred← citeshttps://doi.org/10.37236/448openalex-snapshot
A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of $k$-partite $k$-uniform Hypergraphs
inferred← citeshttps://doi.org/10.37236/627openalex-snapshot
Mr. Paint and Mrs. Correct go Fractional
inferred← citeshttps://doi.org/10.3934/math.2025933openalex-snapshot
Weak degeneracy of the square of the line graph of a subcubic graph
inferred← citeshttps://doi.org/10.4310/joc.2014.v5.n1.a5openalex-snapshot
Three topics in online list coloring
inferred← citeshttps://doi.org/10.48550/arxiv.1212.5694openalex-snapshot
Quantitative Combinatorial Nullstellensatz
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02557openalex-snapshot
List Colouring Big Graphs On-Line
inferred← citeshttps://doi.org/10.48550/arxiv.1602.02589openalex-snapshot
Edge Lower Bounds for List Critical Graphs, via Discharging
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.