On the public citation graph
Adapted List Coloring of Graphs and Hypergraphs
0 signed · 29 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.1093/acprof:oso/9780198528173.001.0001openalex-snapshot
Graphs and Homomorphisms
inferredcites →https://doi.org/10.1137/s0097539703427197openalex-snapshot
Full Constraint Satisfaction Problems
inferredcites →https://doi.org/10.5555/1070432.1070554openalex-snapshot
Two algorithms for general list matrix partitions
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.20391openalex-snapshot
Adapted list coloring of planar graphs
inferred← citeshttps://doi.org/10.1002/jgt.20649openalex-snapshot
An asymptotically tight bound on the adaptable chromatic number
inferred← citeshttps://doi.org/10.1002/jgt.22011openalex-snapshot
The Adaptable Chromatic Number and the Chromatic Number
inferred← citeshttps://doi.org/10.1002/jgt.22956openalex-snapshot
Adaptable and conflict colouring multigraphs with no cycles of length three or four
inferred← citeshttps://doi.org/10.1002/jgt.23025openalex-snapshot
Single-conflict colorings of degenerate graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_13openalex-snapshot
Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_9openalex-snapshot
Hypergraph Dualization with $$\textsf{FPT}$$-delay Parameterized by the Degeneracy and Dimension
inferred← citeshttps://doi.org/10.1007/s00373-017-1833-0openalex-snapshot
On Color Critical Graphs with Large Adaptable Chromatic Numbers
inferred← citeshttps://doi.org/10.1016/j.dam.2015.05.003openalex-snapshot
Algorithms to approximately count and sample conforming colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.004openalex-snapshot
Adaptable choosability of planar graphs with sparse short cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.029openalex-snapshot
Adaptable chromatic number of graph products
inferred← citeshttps://doi.org/10.1016/j.disc.2011.06.016openalex-snapshot
The adaptable choosability number grows with the choosability number
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113973openalex-snapshot
Cooperative coloring of some graph families
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114308openalex-snapshot
Partial packing coloring and quasi-packing coloring of the triangular grid
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.11.015openalex-snapshot
On the adaptable chromatic number of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.06.003openalex-snapshot
An upper bound on adaptable choosability of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.11.001openalex-snapshot
Adapted game colouring of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.02.003openalex-snapshot
Clique versus independent set
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.018openalex-snapshot
Unsolved graph colouring problems
inferred← citeshttps://doi.org/10.1017/s0963548319000026openalex-snapshot
Separation Choosability and Dense Bipartite Induced Subgraphs
inferred← citeshttps://doi.org/10.37236/12429openalex-snapshot
Constructing Graphs with No Independent Transversals
inferred← citeshttps://doi.org/10.70675/32d95afcz2181z4f21z9db9z03c282405e87openalex-snapshot
Hitting sets : VC-dimension and Multicut
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.