On the public citation graph
On acyclic colorings of graphs on surfaces
0 signed · 65 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/bf02759792openalex-snapshot
Every planar graph has an acyclic 7-coloring
inferredcites →https://doi.org/10.1007/bf02764716openalex-snapshot
Acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1007/bf02764717openalex-snapshot
Note on a paper of B. Grünbaum on acyclic colorings
inferredcites →https://doi.org/10.1016/0012-365x(76)90075-3openalex-snapshot
Note to the paper of Grünbaum on acyclic colorings
inferredcites →https://doi.org/10.1016/0012-365x(79)90077-3openalex-snapshot
On acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.03.017openalex-snapshot
On acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1017/s001708950000358xopenalex-snapshot
An acyclic analogue to Heawood's theorem
inferredcites →https://doi.org/10.1073/pnas.60.2.438openalex-snapshot
SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
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.20167openalex-snapshot
The generalized acyclic edge chromatic number of random regular 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.1007/978-3-0346-0425-3_1openalex-snapshot
Algebraic and Probabilistic Methods in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-0348-8974-2_1openalex-snapshot
Randomness and Pseudo-Randomness in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_7openalex-snapshot
Boxicity and Separation Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_9openalex-snapshot
Forbidden Subgraph Colorings and the Oriented Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_29openalex-snapshot
Colorings and Homomorphisms of Minor Closed Classes
inferred← citeshttps://doi.org/10.1007/bf02675788openalex-snapshot
Acyclick-strong coloring of maps on surfaces
inferred← citeshttps://doi.org/10.1007/s00373-005-0635-yopenalex-snapshot
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1007/s00373-008-0798-4openalex-snapshot
On the Acyclic Chromatic Number of Hamming Graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1130-xopenalex-snapshot
Boxicity of Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/s00373-015-1569-7openalex-snapshot
On Low Tree-Depth Decompositions
inferred← citeshttps://doi.org/10.1007/s00453-015-0050-6openalex-snapshot
Separation Dimension of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/s11425-014-4828-9openalex-snapshot
Acyclic improper colouring of graphs with maximum degree 4
inferred← citeshttps://doi.org/10.1007/s11464-015-0497-4openalex-snapshot
Acyclic coloring of graphs without bichromatic long path
inferred← citeshttps://doi.org/10.1007/s40314-022-02156-yopenalex-snapshot
On b-acyclic chromatic number of a graph
inferred← citeshttps://doi.org/10.1007/s40840-020-01040-4openalex-snapshot
Coloring Graphs Without Bichromatic Cycles or Paths
inferred← citeshttps://doi.org/10.1016/j.dam.2023.11.030openalex-snapshot
Hardness transitions and uniqueness of acyclic colouring
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.005openalex-snapshot
Adjacency posets of planar graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.02.007openalex-snapshot
Q -Ramsey classes of 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.ejc.2006.07.013openalex-snapshot
Grad and classes with bounded expansion I. Decompositions
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.007openalex-snapshot
Degenerate and star colorings of graphs on surfaces
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.045openalex-snapshot
Forbidden subgraph colorings and the oriented chromatic number
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104139openalex-snapshot
Injective edge colorings of degenerate graphs and the oriented chromatic number
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.2008.06.057openalex-snapshot
Coloring parameters for graphs on surfaces
inferred← citeshttps://doi.org/10.1016/j.geb.2013.10.002openalex-snapshot
Information-sharing in social networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.11.023openalex-snapshot
Acyclic colorings of products of trees
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.009openalex-snapshot
Universal targets for homomorphisms of edge-colored graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00359-0openalex-snapshot
Acyclic colouring of 1-planar graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139087223.009openalex-snapshot
Colouring graphs on surfaces
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.004openalex-snapshot
Colouring graphs on surfaces
inferred← citeshttps://doi.org/10.1023/a:1019808819476openalex-snapshot
Estimating the Minimal Number of Colors in Acyclic $$k $$ -Strong Colorings of Maps on Surfaces
inferred← citeshttps://doi.org/10.1109/focs.2019.00056openalex-snapshot
Planar Graphs have Bounded Queue-Number
inferred← citeshttps://doi.org/10.1137/060674211openalex-snapshot
Star Coloring and Acyclic Coloring of Locally Planar Graphs
inferred← citeshttps://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferred← citeshttps://doi.org/10.1145/3385731openalex-snapshot
Planar Graphs Have Bounded Queue-Number
inferred← citeshttps://doi.org/10.4213/mzm401openalex-snapshot
К оценке минимального числа цветов в ациклической $k$-сильной раскраске карт на поверхностях
inferred← citeshttps://doi.org/10.4213/mzm811openalex-snapshot
Ациклическая $k$-сильная раскраска карт на поверхностях
inferred← citeshttps://doi.org/10.46298/dmtcs.344openalex-snapshot
Acyclic, Star and Oriented Colourings of Graph Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.2109.00327openalex-snapshot
Universality in minor-closed graph classes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0508323openalex-snapshot
Grad and classes with bounded expansion I. decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.math/0511262openalex-snapshot
Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
inferred← citeshttps://doi.org/10.7151/dmgt.1408openalex-snapshot
On acyclic colorings of direct produts
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.