On the public citation graph
Colorings and orientations of graphs
0 signed · 467 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.3190030315openalex-snapshot
Tournaments and Vandermond's determinant
inferredcites →https://doi.org/10.1007/bf02125351openalex-snapshot
A nowhere-zero point in linear mappings
inferredcites →https://doi.org/10.1007/bf02579177openalex-snapshot
Independence numbers of graphs and generators of ideals
inferredcites →https://doi.org/10.1016/0012-365x(73)90108-8openalex-snapshot
Acyclic orientations of graphs
inferredcites →https://doi.org/10.1016/0095-8956(84)90047-9openalex-snapshot
Regular subgraphs of almost regular graphs
inferredcites →https://doi.org/10.1016/s0012-365x(81)80025-8openalex-snapshot
On the decomposition of a graph into stars
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199910)32:2<153::aid-jgt5>3.0.co;2-popenalex-snapshot
A sharp edge bound on the interval number of a graph
inferred← citeshttps://doi.org/10.1002/0471224561.ch4openalex-snapshot
Channel Assignment and Graph Multicoloring
inferred← citeshttps://doi.org/10.1002/1098-2418(200009)17:2<117::aid-rsa3>3.0.co;2-9openalex-snapshot
Asymptotics of the list-chromatic index for multigraphs
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/jgt.10029openalex-snapshot
Total choosability of multicircuits I
inferred← citeshttps://doi.org/10.1002/jgt.10030openalex-snapshot
Total choosability of multicircuits II
inferred← citeshttps://doi.org/10.1002/jgt.20112openalex-snapshot
Anti‐magic graphs via the Combinatorial NullStellenSatz
inferred← citeshttps://doi.org/10.1002/jgt.20204openalex-snapshot
Multicolored trees in complete graphs
inferred← citeshttps://doi.org/10.1002/jgt.20298openalex-snapshot
New bounds for the chromatic number of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20333openalex-snapshot
Circular choosability via combinatorial Nullstellensatz
inferred← citeshttps://doi.org/10.1002/jgt.20460openalex-snapshot
Choosability of toroidal graphs without short cycles
inferred← citeshttps://doi.org/10.1002/jgt.20500openalex-snapshot
Total weight choosability of graphs
inferred← citeshttps://doi.org/10.1002/jgt.22017openalex-snapshot
Jacobsthal Numbers in Generalized Petersen Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22107openalex-snapshot
General Parity Result and Cycle‐Plus‐Triangles Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22128openalex-snapshot
Extracting List Colorings from Large Independent Sets
inferred← citeshttps://doi.org/10.1002/jgt.22227openalex-snapshot
Sharp Dirac's theorem for DP‐critical graphs
inferred← citeshttps://doi.org/10.1002/jgt.22459openalex-snapshot
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22469openalex-snapshot
On density of subgraphs of Cartesian products
inferred← citeshttps://doi.org/10.1002/jgt.22498openalex-snapshot
Orientations of graphs avoiding given lists on out‐degrees
inferred← citeshttps://doi.org/10.1002/jgt.22520openalex-snapshot
List coloring triangle‐free planar graphs
inferred← citeshttps://doi.org/10.1002/jgt.22949openalex-snapshot
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
inferred← citeshttps://doi.org/10.1002/jgt.23047openalex-snapshot
The Alon–Tarsi number of planar graphs revisited
inferred← citeshttps://doi.org/10.1002/jgt.23103openalex-snapshot
Flexible list colorings: Maximizing the number of requests satisfied
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.1002/jgt.70031openalex-snapshot
Towards Characterization of Five‐List‐Colorability of Toroidal Graphs
inferred← citeshttps://doi.org/10.1002/jgt.70095openalex-snapshot
Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3
inferred← citeshttps://doi.org/10.1006/aama.1996.0522openalex-snapshot
The Cayley Determinant of the Determinant Tensor and the Alon–Tarsi Conjecture
inferred← citeshttps://doi.org/10.1006/aima.1997.1623openalex-snapshot
On the Number of Even and Odd Latin Squares of Orderp+1
inferred← citeshttps://doi.org/10.1006/eujc.2000.0430openalex-snapshot
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs
inferred← citeshttps://doi.org/10.1006/jagm.1999.1122openalex-snapshot
Finding Skew Partitions Efficiently
inferred← citeshttps://doi.org/10.1006/jcta.1996.0001openalex-snapshot
Asymptotically Good List-Colorings
inferred← citeshttps://doi.org/10.1006/jctb.1997.1753openalex-snapshot
A Note on Graph Colorings and Graph Polynomials
inferred← citeshttps://doi.org/10.1006/jctb.1997.1776openalex-snapshot
Chords of Longest Cycles in Cubic Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1997.1812openalex-snapshot
List Homomorphisms to Reflexive Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1998.1893openalex-snapshot
The 4-Choosability of Plane Graphs without 4-Cycles
inferred← citeshttps://doi.org/10.1006/jctb.2001.2038openalex-snapshot
On Structure of Some Plane Graphs with Application to Choosability
inferred← citeshttps://doi.org/10.1006/jctb.2001.2107openalex-snapshot
Coloring Face-Hypergraphs of Graphs on Surfaces
inferred← citeshttps://doi.org/10.1006/jnth.1996.0029openalex-snapshot
The Polynomial Method and Restricted Sums of Congruence Classes
inferred← citeshttps://doi.org/10.1006/jnth.1998.2235openalex-snapshot
Sumsets in Vector Spaces over Finite Fields
inferred← citeshttps://doi.org/10.1007/10719839_18openalex-snapshot
Finding Skew Partitions Efficiently
inferred← citeshttps://doi.org/10.1007/11780342_35openalex-snapshot
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
inferred← citeshttps://doi.org/10.1007/2-287-33846-2_30openalex-snapshot
Cinq-coloration des graphes planaires
inferred← citeshttps://doi.org/10.1007/3-540-36184-7_6openalex-snapshot
On the List Colouring Problem
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_43openalex-snapshot
Competitive call control in mobile networks
inferred← citeshttps://doi.org/10.1007/88-470-0451-9_30openalex-snapshot
Colorazione di grafi piani con cinque colori
inferred← citeshttps://doi.org/10.1007/978-0-8176-4789-6_10openalex-snapshot
Graph Polynomials and Their Applications II: Interrelations and Interpretations
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_9openalex-snapshot
Some Remarks on the Cycle Plus Triangles Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_22openalex-snapshot
On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_3openalex-snapshot
De Bruijn Digraphs, Kautz Digraphs, and Their Generalizations
inferred← citeshttps://doi.org/10.1007/978-2-8178-0400-2_34openalex-snapshot
Cinq-coloration des graphes planaires
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_21openalex-snapshot
Semi-random Process Without Replacement
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_10openalex-snapshot
5-List Coloring Toroidal 6-Regular Triangulations in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_8openalex-snapshot
Exact and Parameterized Algorithms for Choosability
inferred← citeshttps://doi.org/10.1007/978-3-0346-0425-3_1openalex-snapshot
Algebraic and Probabilistic Methods in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-0346-0425-3_7openalex-snapshot
Combinatorics with a Geometric Flavor
inferred← citeshttps://doi.org/10.1007/978-3-319-31940-7_11openalex-snapshot
Two Chromatic Conjectures: One for Vertices and One for Edges
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_2openalex-snapshot
Fair Representation by Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-73915-1_39openalex-snapshot
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
inferred← citeshttps://doi.org/10.1007/978-3-319-94418-0_26openalex-snapshot
Algorithm Analysis Through Proof Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_19openalex-snapshot
Group Coloring and List Group Coloring Are Π2 P -Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_29openalex-snapshot
Asymptotically Optimal Hitting Sets Against Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-642-00856-6_34openalex-snapshot
Five-coloring plane graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13580-4_13openalex-snapshot
List Total Weighting of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_17openalex-snapshot
Recognizing d-Interval Graphs and d-Track Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_4openalex-snapshot
Some Combinatorial Applications of Gröbner Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-56666-0_33openalex-snapshot
Representing Graph Properties by Polynomial Ideals
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_13openalex-snapshot
Some Remarks on the Cycle Plus Triangles Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-60408-9_26openalex-snapshot
On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings
inferred← citeshttps://doi.org/10.1007/978-3-662-04315-8_27openalex-snapshot
Five-coloring plane graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-05412-3_30openalex-snapshot
Five-coloring plane graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-22343-7_25openalex-snapshot
Five-coloring plane graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_24openalex-snapshot
Listing Acyclic Orientations of Graphs with Single and Multiple Sources
inferred← citeshttps://doi.org/10.1007/bf01261320openalex-snapshot
List edge colourings of some 1-factorable multigraphs
inferred← citeshttps://doi.org/10.1007/bf02831929openalex-snapshot
Circular list colorings of some graphs
inferred← citeshttps://doi.org/10.1007/s00037-022-00233-6openalex-snapshot
The Complexity of Finding Fair Independent Sets in Cycles
inferred← citeshttps://doi.org/10.1007/s00209-024-03647-wopenalex-snapshot
Some unimodal sequences of Kronecker coefficients
inferred← citeshttps://doi.org/10.1007/s00224-002-1032-zopenalex-snapshot
Competitive Call Control in Mobile Networks
inferred← citeshttps://doi.org/10.1007/s00224-007-9022-9openalex-snapshot
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
inferred← citeshttps://doi.org/10.1007/s00236-025-00492-0openalex-snapshot
Exact and parameterized algorithms for choosability
inferred← citeshttps://doi.org/10.1007/s00373-002-0486-8openalex-snapshot
Choosability of Powers of Circuits
inferred← citeshttps://doi.org/10.1007/s00373-013-1382-0openalex-snapshot
Orientations of Graphs with Prescribed Weighted Out-Degrees
inferred← citeshttps://doi.org/10.1007/s00373-014-1411-7openalex-snapshot
An Algebraic Criterion for the Choosability of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-016-1732-9openalex-snapshot
On the Choosability of Claw-Free Perfect Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1812-5openalex-snapshot
(4, 2)-Choosability of Planar Graphs with Forbidden Structures
inferred← citeshttps://doi.org/10.1007/s00373-019-02025-2openalex-snapshot
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from $$\{6,7,8\}$$ { 6 , 7 , 8 }
inferred← citeshttps://doi.org/10.1007/s00373-019-02056-9openalex-snapshot
Alon–Tarsi Number and Modulo Alon–Tarsi Number of Signed Graphs
inferred← citeshttps://doi.org/10.1007/s00373-020-02177-6openalex-snapshot
A Generalization of Some Results on List Coloring and DP-Coloring
inferred← citeshttps://doi.org/10.1007/s00373-023-02650-yopenalex-snapshot
Girth Conditions and Rota’s Basis Conjecture
inferred← citeshttps://doi.org/10.1007/s00373-023-02708-xopenalex-snapshot
A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent $$4^-$$-Cycles
inferred← citeshttps://doi.org/10.1007/s00373-024-02797-2openalex-snapshot
An Alon–Tarsi Style Theorem for Additive Colorings
inferred← citeshttps://doi.org/10.1007/s00453-012-9651-5openalex-snapshot
Recognizing d-Interval Graphs and d-Track Interval Graphs
inferred← citeshttps://doi.org/10.1007/s00493-005-0020-8openalex-snapshot
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem
inferred← citeshttps://doi.org/10.1007/s00493-008-2231-2openalex-snapshot
Pfaffian labelings and signs of edge colorings
inferred← citeshttps://doi.org/10.1007/s00493-014-3057-8openalex-snapshot
Every graph is (2,3)-choosable
inferred← citeshttps://doi.org/10.1007/s00493-015-3373-7openalex-snapshot
Square-root cancellation for the signs of Latin squares
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.1007/s00493-021-4330-2openalex-snapshot
Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane
inferred← citeshttps://doi.org/10.1007/s00493-024-00109-zopenalex-snapshot
List-Avoiding Orientations
inferred← citeshttps://doi.org/10.1007/s10255-004-0197-4openalex-snapshot
On 3-colorings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/s10623-021-00859-7openalex-snapshot
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz
inferred← citeshttps://doi.org/10.1007/s10801-014-0562-1openalex-snapshot
An online version of Rota’s basis conjecture
inferred← citeshttps://doi.org/10.1007/s10878-015-9943-1openalex-snapshot
Total weight choosability of Mycielski graphs
inferred← citeshttps://doi.org/10.1007/s10878-016-0094-9openalex-snapshot
A note on orientation and chromatic number of graphs
inferred← citeshttps://doi.org/10.1007/s10878-023-01099-2openalex-snapshot
On the Alon–Tarsi number of semi-strong product of graphs
inferred← citeshttps://doi.org/10.1007/s10878-024-01111-3openalex-snapshot
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs
inferred← citeshttps://doi.org/10.1007/s11425-011-4191-zopenalex-snapshot
On 3-choosability of triangle-free plane graphs
inferred← citeshttps://doi.org/10.1007/s11565-014-0202-7openalex-snapshot
Geometric complexity theory: an introduction for geometers
inferred← citeshttps://doi.org/10.1007/s11766-004-0028-7openalex-snapshot
On 3-choosability of plane graphs without 6-, 7- and 9-cycles
inferred← citeshttps://doi.org/10.1007/s11766-999-0062-6openalex-snapshot
The list chromatic numbers of some planar graphs
inferred← citeshttps://doi.org/10.1007/s11856-016-1361-2openalex-snapshot
Coloring, sparseness and girth
inferred← citeshttps://doi.org/10.1007/s40840-021-01218-4openalex-snapshot
On (3, r)-Choosability of Some Planar Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00057-xopenalex-snapshot
Stable sets and polynomials
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90607-hopenalex-snapshot
Binary invariants and orientations of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90579-iopenalex-snapshot
List colourings of planar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00055-nopenalex-snapshot
On the Dinitz conjecture and related conjectures
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00071-3openalex-snapshot
An exchange property of matroid
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00180-9openalex-snapshot
A not 3-choosable planar graph without 3-cycles
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90114-7openalex-snapshot
On the relations of various conjectures on Latin squares and straightening coefficients
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00104-5openalex-snapshot
The complexity of planar graph choosability
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00216-jopenalex-snapshot
Choosability of planar graphs
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90052-7openalex-snapshot
Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90115-9openalex-snapshot
On even and odd latin squares
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90150-3openalex-snapshot
Algorithmic complexity of list colorings
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50034-8openalex-snapshot
10.1016/b978-044488002-4/50034-8
inferred← citeshttps://doi.org/10.1016/j.aam.2020.102131openalex-snapshot
On the chromatic polynomial and counting DP-colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102204openalex-snapshot
Isotopy graphs of Latin tableaux
inferred← citeshttps://doi.org/10.1016/j.aam.2023.102593openalex-snapshot
Rota's basis conjecture for matroids with density close to one
inferred← citeshttps://doi.org/10.1016/j.aim.2015.06.015openalex-snapshot
The odd case of Rota's bases conjecture
inferred← citeshttps://doi.org/10.1016/j.aim.2018.09.027openalex-snapshot
Geometric conditions for □-irreducibility of certain representations of the general linear group over a non-archimedean local field
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128126openalex-snapshot
Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2004.11.005openalex-snapshot
Generalized list T-colorings of cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2010.08.007openalex-snapshot
Dynamic list coloring of bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.028openalex-snapshot
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.08.002openalex-snapshot
Efficient enumeration of graph orientations with sources
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.014openalex-snapshot
Planar graphs without chordal 6-cycles are 4-choosable
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.06.003openalex-snapshot
A note on Alon–Tarsi number of Halin graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.023openalex-snapshot
Notes on Boolean read- k and multilinear circuits
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.032openalex-snapshot
5-list coloring toroidal 6-regular triangulations in linear time
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.dam.2026.02.048openalex-snapshot
On orientations with forbidden out-degrees
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.030openalex-snapshot
A compactness argument in the additive theory and the polynomial method
inferred← citeshttps://doi.org/10.1016/j.disc.2004.10.023openalex-snapshot
The 3-choosability of plane graphs of girth 4
inferred← citeshttps://doi.org/10.1016/j.disc.2005.05.001openalex-snapshot
A note on 3-choosability of planar graphs without certain cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.031openalex-snapshot
Perfect graphs, kernels, and cores of cooperative games
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.034openalex-snapshot
Extended skew partition problem
inferred← citeshttps://doi.org/10.1016/j.disc.2006.02.001openalex-snapshot
Bordeaux 3-color conjecture and 3-choosability
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.027openalex-snapshot
List colourings of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.005openalex-snapshot
Injective colorings of planar graphs with few colors
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.061openalex-snapshot
Some results on (a:b) -choosability
inferred← citeshttps://doi.org/10.1016/j.disc.2008.05.055openalex-snapshot
On 3-choosable planar graphs of girth at least 4
inferred← citeshttps://doi.org/10.1016/j.disc.2009.04.010openalex-snapshot
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
inferred← citeshttps://doi.org/10.1016/j.disc.2009.08.005openalex-snapshot
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
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.11.011openalex-snapshot
Colorings of plane graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2015.01.027openalex-snapshot
Connections between conjectures of Alon–Tarsi, Hadamard–Howe, and integrals over the special unitary group
inferred← citeshttps://doi.org/10.1016/j.disc.2015.11.022openalex-snapshot
Polynomial graph invariants from homomorphism numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2016.10.002openalex-snapshot
Total weight choosability of graphs with bounded maximum average degree
inferred← citeshttps://doi.org/10.1016/j.disc.2017.03.012openalex-snapshot
Planar graphs without intersecting 5 -cycles are 4 -choosable
inferred← citeshttps://doi.org/10.1016/j.disc.2017.05.014openalex-snapshot
Injective choosability of subcubic planar graphs with girth 6
inferred← citeshttps://doi.org/10.1016/j.disc.2018.04.025openalex-snapshot
The list L(2,1) -labeling of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.05.002openalex-snapshot
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.06.036openalex-snapshot
Graphs with maximum average degree less than 114 are (1,3) -choosable
inferred← citeshttps://doi.org/10.1016/j.disc.2018.08.003openalex-snapshot
A note on the DP-chromatic number of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.10.004openalex-snapshot
Graphs are (1,Δ+1) -choosable
inferred← citeshttps://doi.org/10.1016/j.disc.2019.04.018openalex-snapshot
The Alon–Tarsi conjecture: A perspective on the main results
inferred← citeshttps://doi.org/10.1016/j.disc.2019.06.021openalex-snapshot
Note on 3-choosability of planar graphs with maximum degree 4
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.2021.112471openalex-snapshot
Differences between the list-coloring and DP-coloring for planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112764openalex-snapshot
The Alon-Tarsi number of K5-minor-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112790openalex-snapshot
DP-4-colorability of planar graphs without intersecting 5-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113093openalex-snapshot
The DP color function of joins and vertex-gluings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113298openalex-snapshot
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113347openalex-snapshot
Relation between the correspondence chromatic number and the Alon–Tarsi number
showing the first 200 of 456 · page through all 456
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.