On the public citation graph
Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants
0 signed · 73 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.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.1007/bf01261320openalex-snapshot
List edge colourings of some 1-factorable multigraphs
inferredcites →https://doi.org/10.1016/0001-8708(89)90028-5openalex-snapshot
Generalized Rogers-Ramanujan bijections
inferredcites →https://doi.org/10.1016/0012-365x(84)90159-6openalex-snapshot
Identities in combinatorics III: Further aspects of ordered set sorting
inferredcites →https://doi.org/10.1016/0012-365x(92)90588-7openalex-snapshot
A solution to a colouring problem of P. Erdős
inferredcites →https://doi.org/10.1016/j.disc.2007.06.003openalex-snapshot
A combinatorial proof of the Lebesgue identity
inferredcites →https://doi.org/10.1016/j.disc.2008.04.048openalex-snapshot
On the combinatorics of the Pfaff identity
inferredcites →https://doi.org/10.1016/j.disc.2010.07.019openalex-snapshot
Brooks’ Theorem via the Alon–Tarsi Theorem
inferredcites →https://doi.org/10.1016/j.ejc.2005.07.007openalex-snapshot
A q -analog of dual sequences with applications
inferredcites →https://doi.org/10.1016/s0195-6698(03)00062-3openalex-snapshot
Combinatorial identities in dual sequences
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/s0025557200177794openalex-snapshot
89.44 A curious identity proved by Cauchy’s integral formula
inferredcites →https://doi.org/10.1017/s0025557200181094openalex-snapshot
91.13 A new proof of a curious identity
inferredcites →https://doi.org/10.1017/s0963548397002927openalex-snapshot
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple 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/1087openalex-snapshot
Colorings and Orientations of Matrices and Graphs
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.4171/owr/2006/48openalex-snapshot
Combinatorics, Probability and Computing
inferredcites →https://doi.org/10.5281/zenodo.7673483openalex-snapshot
Generalization of a Binomial Identity of Simons
inferredcites →https://doi.org/10.5281/zenodo.8281193openalex-snapshot
Combinatorial Proofs of Some Simons-type Binomial Coefficient Identities
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.1007/978-1-4939-0938-4_15openalex-snapshot
Affine Permutations and an Affine Catalan Monoid
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/s00373-014-1441-1openalex-snapshot
Sum-Paintability of Generalized Theta-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.1007/s00493-019-4014-3openalex-snapshot
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles
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.2022.02.006openalex-snapshot
Graph polynomials and paintability of plane 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.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.11.015openalex-snapshot
Locally planar graphs are 5-paintable
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111797openalex-snapshot
The Alon–Tarsi number of planar graphs without cycles of lengths 4 and l
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112115openalex-snapshot
Combinatorial Nullstellensatz and DP-coloring of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113347openalex-snapshot
Relation between the correspondence chromatic number and the Alon–Tarsi number
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.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.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.jctb.2010.12.007openalex-snapshot
On two generalizations of the Alon–Tarsi polynomial method
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.2139/ssrn.5928417openalex-snapshot
Alon-Tarsi Number of Planar Graphs With No 4-Cycles and 5-Cycles at Distance $\geq 4$
inferred← citeshttps://doi.org/10.37236/10898openalex-snapshot
Coloring, List Coloring, and Painting Squares of Graphs (and Other Related Problems)
inferred← citeshttps://doi.org/10.37236/2050openalex-snapshot
On-Line List Colouring of Complete Multipartite 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/4978openalex-snapshot
Painting Squares in $\Delta^2-1$ Shades
inferred← citeshttps://doi.org/10.37236/552openalex-snapshot
Colorings and Nowhere-Zero Flows of Graphs in Terms of Berlekamp's Switching Game
inferred← citeshttps://doi.org/10.37236/7740openalex-snapshot
On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs
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.1501.00224openalex-snapshot
Coloring games and algebraic problems on matroids
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02557openalex-snapshot
List Colouring Big Graphs On-Line
inferred← citeshttps://doi.org/10.48550/arxiv.1910.12598openalex-snapshot
The Alon-Tarsi number of planar graphs without cycles of lengths $4$ and $l$
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.