On the public citation graph
A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of $k$-partite $k$-uniform Hypergraphs
0 signed · 46 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.1007/bf01204715openalex-snapshot
Colorings and orientations of graphs
inferredcites →https://doi.org/10.1007/bf02125351openalex-snapshot
A nowhere-zero point in linear mappings
inferredcites →https://doi.org/10.1007/s00493-005-0020-8openalex-snapshot
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem
inferredcites →https://doi.org/10.1016/j.disc.2010.07.019openalex-snapshot
Brooks’ Theorem via the Alon–Tarsi Theorem
inferredcites →https://doi.org/10.1017/cbo9780511566059.004openalex-snapshot
Combinatorial Nullstellensatz
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.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/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.1007/978-3-319-78825-8_19openalex-snapshot
Orientations of 1-Factors and the List Edge Coloring Conjecture
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.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.2022.113187openalex-snapshot
Transformation invariance in the Combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices
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.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.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.jda.2018.11.014openalex-snapshot
Computing the list chromatic index of graphs
inferred← citeshttps://doi.org/10.20429/tag.2022.090103openalex-snapshot
Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings
inferred← citeshttps://doi.org/10.37236/11888openalex-snapshot
Schnyder Woods and Alon-Tarsi Number of Planar Graphs
inferred← citeshttps://doi.org/10.37236/2050openalex-snapshot
On-Line List Colouring of Complete Multipartite 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/4084openalex-snapshot
Proof of the List Edge Coloring Conjecture for Complete Graphs of Prime Degree
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.48550/arxiv.1501.00224openalex-snapshot
Coloring games and algebraic problems on matroids
inferred← citeshttps://doi.org/10.48550/arxiv.1705.00484openalex-snapshot
Orientations of 1-Factorizations and the List Chromatic Index of Small Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2102.02746openalex-snapshot
On list chromatic numbers of 2-colorable hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2110.11617openalex-snapshot
The Alon-Tarsi number of Halin graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2023.11.1.13openalex-snapshot
The Alon-Tarsi number of two kinds of planar 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.