On the public citation graph

Note on a paper of B. Grünbaum on acyclic colorings

https://doi.org/10.1007/bf02764717
0 signed · 18 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02764716openalex-snapshot
Acyclic colorings of planar 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/9781118032497.ch2openalex-snapshot
Planar Graphs
inferred← citeshttps://doi.org/10.1002/jgt.20394openalex-snapshot
Planar graphs without 4‐cycles adjacent to 3‐cycles are list vertex 2‐arborable
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_59openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_59-1openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/bf02762708openalex-snapshot
On acyclic colorings of graphs on surfaces
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-021-02433-3openalex-snapshot
Complex and Homomorphic Chromatic Number of Signed Planar Simple Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90077-3openalex-snapshot
On acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90166-yopenalex-snapshot
Acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2018.02.015openalex-snapshot
On acyclically 4-colorable maximal planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.017openalex-snapshot
On acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.12.016openalex-snapshot
Acyclic colorings of locally planar graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.12.005openalex-snapshot
Acyclically 4-colorable triangulations
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.07.006openalex-snapshot
A refinement of choosability of graphs
inferred← citeshttps://doi.org/10.1023/b:joco.0000038912.82046.17openalex-snapshot
Vertex and Tree Arboricities of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1403.5013openalex-snapshot
Tree-colorable maximal planar graphs
inferred← citeshttps://doi.org/10.70675/9818ede9z001cz4a4cz94b2z8e8d4abab62aopenalex-snapshot
Vertex partition of sparse 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.