On the public citation graph
Every planar graph has an acyclic 7-coloring
0 signed · 71 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/bf02764716openalex-snapshot
Acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1215/ijm/1256049898openalex-snapshot
The existence of unavoidable sets of geographically good configurations
inferredcites →https://doi.org/10.1215/s0012-7094-74-04119-2openalex-snapshot
Every planar graph has an acyclic 8-coloring
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.20134openalex-snapshot
On the acyclic choosability of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20206openalex-snapshot
Acyclic 5‐choosability of planar graphs without small cycles
inferred← citeshttps://doi.org/10.1002/jgt.20299openalex-snapshot
A conjecture of Borodin and a coloring of Grünbaum
inferred← citeshttps://doi.org/10.1002/jgt.20381openalex-snapshot
Planar graphs without 4‐cycles are acyclically 6‐choosable
inferred← citeshttps://doi.org/10.1002/jgt.20604openalex-snapshot
A sufficient condition for planar graphs to be acyclically 5‐choosable
inferred← citeshttps://doi.org/10.1002/jgt.21647openalex-snapshot
Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
inferred← citeshttps://doi.org/10.1007/11604686_21openalex-snapshot
Acyclic Choosability of Graphs with Small Maximum Degree
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_23openalex-snapshot
Acyclic 4-Choosability of Planar Graphs Without Cycles of Specific Lengths
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_11openalex-snapshot
Acyclically 3-Colorable Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_20openalex-snapshot
Acyclic Colorings of Graph Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-642-35926-2_11openalex-snapshot
Acyclic Coloring with Few Division Vertices
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_23openalex-snapshot
Acyclic 4-choosability of Planar Graphs with Girth at Least 5
inferred← citeshttps://doi.org/10.1007/bf02762708openalex-snapshot
On acyclic colorings of graphs on surfaces
inferred← citeshttps://doi.org/10.1007/s10114-023-1518-yopenalex-snapshot
Every Graph Embedded on the Surface with Euler Characteristic Number ε = −1 is Acyclically 11-choosable
inferred← citeshttps://doi.org/10.1007/s10878-011-9385-3openalex-snapshot
Acyclically 3-colorable planar graphs
inferred← citeshttps://doi.org/10.1007/s10878-014-9799-9openalex-snapshot
Acyclic 3-coloring of generalized Petersen graphs
inferred← citeshttps://doi.org/10.1007/s11425-013-4572-6openalex-snapshot
Acyclic 6-choosability of planar graphs without adjacent short cycles
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90077-3openalex-snapshot
On acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00088-3openalex-snapshot
Good and semi-strong colorings of oriented planar graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2015.09.084openalex-snapshot
Acyclic and star coloring of P 4 -reducible and P 4 -sparse graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129614openalex-snapshot
An identifying operation on a 1-planar graph with an application to acyclic coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2011.03.017openalex-snapshot
Acyclic chromatic indices of planar graphs with large girth
inferred← citeshttps://doi.org/10.1016/j.dam.2012.11.006openalex-snapshot
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
inferred← citeshttps://doi.org/10.1016/j.dam.2020.01.010openalex-snapshot
An improved upper bound for the acyclic chromatic number of 1-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.disc.2007.11.076openalex-snapshot
Acyclic 5-choosability of planar graphs without 4-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.018openalex-snapshot
Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.036openalex-snapshot
On acyclic 4-choosability of planar graphs without short cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2010.07.001openalex-snapshot
Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2010.10.003openalex-snapshot
Acyclic 4-choosability of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.07.038openalex-snapshot
Acyclic 4-choosability of planar graphs without adjacent short cycles
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.2014.01.022openalex-snapshot
Acyclic vertex coloring of graphs of maximum degree six
inferred← citeshttps://doi.org/10.1016/j.disc.2019.07.001openalex-snapshot
Acyclic L -coloring of graphs with maximum degrees 5 and 6
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111623openalex-snapshot
Acyclic coloring of IC-planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112476openalex-snapshot
On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115346openalex-snapshot
On acyclic 4-choosability of planar graphs without cycles of length 4, 8 and 9
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.endm.2006.06.039openalex-snapshot
A Conjecture of Borodin and a Coloring of Grünbaum
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.006openalex-snapshot
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.111openalex-snapshot
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.05.005openalex-snapshot
Graphs with maximum degree 6 are acyclically 11-colorable
inferred← citeshttps://doi.org/10.1016/j.jda.2012.06.001openalex-snapshot
Acyclic colorings of graph subdivisions revisited
inferred← citeshttps://doi.org/10.1016/j.jda.2013.08.002openalex-snapshot
Acyclic coloring with few division vertices
inferred← citeshttps://doi.org/10.1017/s001708950000358xopenalex-snapshot
An acyclic analogue to Heawood's theorem
inferred← citeshttps://doi.org/10.1063/1.3525210openalex-snapshot
Acyclic Coloring of 5‐regularless Graphs with Maximum Degree 5 with Seven Colors
inferred← citeshttps://doi.org/10.1080/00207160.2018.1476684openalex-snapshot
Construction of acyclically 4-colourable planar triangulations with minimum degree 4
inferred← citeshttps://doi.org/10.1109/bdacs53596.2021.00062openalex-snapshot
The acyclic coloring of the Direct product and Semi-strong product of special graphs
inferred← citeshttps://doi.org/10.1109/iccitechn.2012.6509751openalex-snapshot
On acyclic colorings of graphs
inferred← citeshttps://doi.org/10.1109/iccsmt51754.2020.00021openalex-snapshot
The acyclic coloring of the Corona product and Edge corona product of special graphs
inferred← citeshttps://doi.org/10.1112/s0024610799007942openalex-snapshot
Acyclic Colourings of Planar Graphs with Large Girth
inferred← citeshttps://doi.org/10.1134/s0037446611030049openalex-snapshot
Acyclic 5-choosability of planar graphs without 4-cycles
inferred← citeshttps://doi.org/10.1134/s1990478910040034openalex-snapshot
Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
inferred← citeshttps://doi.org/10.1134/s1990478911010042openalex-snapshot
Acyclic 4-coloring of planar graphs without 4- and 5-cycles
inferred← citeshttps://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferred← citeshttps://doi.org/10.1142/s1793830918500143openalex-snapshot
Acyclic 4-choosability of planar graphs without intersecting short cycles
inferred← citeshttps://doi.org/10.1142/s1793830922500409openalex-snapshot
Injective edge-coloring of subcubic graphs
inferred← citeshttps://doi.org/10.21136/cmj.2019.0197-18openalex-snapshot
Acyclic 4-choosability of planar graphs without 4-cycles
inferred← citeshttps://doi.org/10.26493/1855-3974.198.541openalex-snapshot
Graphs with maximum degree 5 are acyclically 7-colorable
inferred← citeshttps://doi.org/10.46298/dmtcs.344openalex-snapshot
Acyclic, Star and Oriented Colourings of Graph Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.1907.09838openalex-snapshot
Injective edge-coloring of sparse graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0511262openalex-snapshot
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
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.