On the public citation graph

On trees of polygons

https://doi.org/10.1007/bf01270490
0 signed · 21 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.1002/jgt.3190090209openalex-snapshot
Chromaticity of two‐trees
inferredcites →https://doi.org/10.1007/bf01193920openalex-snapshot
Chromatic polynomials of connected graphs
inferredcites →https://doi.org/10.1007/bfb0070369openalex-snapshot
On chromatic equivalence of graphs
inferredcites →https://doi.org/10.1016/0012-365x(80)90154-5openalex-snapshot
On chromatic coefficients
inferredcites →https://doi.org/10.1016/s0021-9800(68)80087-0openalex-snapshot
An introduction to chromatic polynomials
inferredcites →https://doi.org/10.2307/1968214openalex-snapshot
The Coloring of Graphs
inferredcites →https://doi.org/10.4064/fm-15-1-271-283openalex-snapshot
Sur le problème des courbes gauches en Topologie

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.3190160507openalex-snapshot
Chromatic polynomials, polygon trees, and outerplanar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90231-2openalex-snapshot
Chromatic polynomials of generalized trees
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90334-copenalex-snapshot
The chromatic uniqueness of W10
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00355-mopenalex-snapshot
Chromaticity of series-parallel graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90033-7openalex-snapshot
Classes of chromatically equivalent graphs and polygon trees
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.016openalex-snapshot
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00269-5openalex-snapshot
The search for chromatically unique graphs — II
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)81814-6openalex-snapshot
On the chromatic equivalence class of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70808-2openalex-snapshot
Chromatic Polynomials of Generalized Trees
inferred← citeshttps://doi.org/10.1017/s1446788700034121openalex-snapshot
On the chromatic uniqueness of certain trees of polygons
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb16400.xopenalex-snapshot
Graph Theory in China
inferred← citeshttps://doi.org/10.1142/s0218216518400072openalex-snapshot
Patterns in Khovanov link and chromatic graph homology
inferred← citeshttps://doi.org/10.7151/dmgt.1003openalex-snapshot
On chromaticity of 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.