On the public citation graph
Colorings, transversals, and local sparsity
0 signed · 32 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/(sici)1097-0118(199906)31:2<149::aid-jgt8>3.0.co;2-#openalex-snapshot
The list colouring constants
inferredcites →https://doi.org/10.1002/jgt.10054openalex-snapshot
On a list coloring conjecture of Reed
inferredcites →https://doi.org/10.1002/jgt.20649openalex-snapshot
An asymptotically tight bound on the adaptable chromatic number
inferredcites →https://doi.org/10.1006/jctb.2002.2110openalex-snapshot
Asymptotically the List Colouring Constants Are 1
inferredcites →https://doi.org/10.1007/bf01793010openalex-snapshot
A condition for matchability in hypergraphs
inferredcites →https://doi.org/10.1007/bf02699376openalex-snapshot
Concentration of measure and isoperimetric inequalities in product spaces
inferredcites →https://doi.org/10.1007/s00493-006-0019-9openalex-snapshot
Extremal Problems For Transversals In Graphs With Bounded Degree
inferredcites →https://doi.org/10.1016/0012-365x(75)90011-4openalex-snapshot
On complete subgraphs of r-chromatic graphs
inferredcites →https://doi.org/10.1016/j.endm.2015.06.038openalex-snapshot
A Stronger Bound for the Strong Chromatic Index
inferredcites →https://doi.org/10.1016/j.jctb.2007.02.003openalex-snapshot
Independent transversals in locally sparse graphs
inferredcites →https://doi.org/10.1016/j.jctb.2014.06.004openalex-snapshot
Colouring graphs when the number of colours is almost the maximum degree
inferredcites →https://doi.org/10.1016/j.jctb.2016.06.006openalex-snapshot
5-list-coloring planar graphs with distant precolored vertices
inferredcites →https://doi.org/10.1016/j.jctb.2019.08.001openalex-snapshot
A local epsilon version of Reed's Conjecture
inferredcites →https://doi.org/10.1016/j.jctb.2022.01.004openalex-snapshot
An average degree condition for independent transversals
inferredcites →https://doi.org/10.1017/s0963548300001206openalex-snapshot
Independent Transversals in Sparse Partite Hypergraphs
inferredcites →https://doi.org/10.1017/s0963548301004758openalex-snapshot
A Note on Vertex List Colouring
inferredcites →https://doi.org/10.1137/0403018openalex-snapshot
Transversals of Vertex Partitions in 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/jgt.22876openalex-snapshot
Graphs of low average degree without independent transversals
inferred← citeshttps://doi.org/10.1002/jgt.23025openalex-snapshot
Single-conflict colorings of degenerate graphs
inferred← citeshttps://doi.org/10.1002/jgt.23085openalex-snapshot
Degree criteria and stability for independent transversals
inferred← citeshttps://doi.org/10.1002/rsa.70012openalex-snapshot
Coloring Graphs With Forbidden Almost Bipartite Subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2026.04.010openalex-snapshot
Hypergraph cooperative coloring
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.01.004openalex-snapshot
An average degree condition for independent transversals
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.07.005openalex-snapshot
Approximate packing of independent transversals in locally sparse graphs
inferred← citeshttps://doi.org/10.1017/s0963548323000299openalex-snapshot
A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree
inferred← citeshttps://doi.org/10.37236/10529openalex-snapshot
On Factors of Independent Transversals in $k$-Partite Graphs
inferred← citeshttps://doi.org/10.37236/12429openalex-snapshot
Constructing Graphs with No Independent Transversals
inferred← citeshttps://doi.org/10.4153/s0008439521001004openalex-snapshot
Independent transversals in bipartite correspondence-covers
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.