On the public citation graph

On chromatic equivalence of graphs

https://doi.org/10.1007/bfb0070369
0 signed · 89 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/bfb0066441openalex-snapshot
Chromatically equivalent graphs
inferredcites →https://doi.org/10.1016/s0021-9800(68)80087-0openalex-snapshot
An introduction to chromatic polynomials
inferredcites →https://doi.org/10.1016/s0021-9800(70)80067-9openalex-snapshot
On chromatic polynomials and the golden ratio
inferredcites →https://doi.org/10.1080/00401706.1969.10490702openalex-snapshot
Combinatorial Identities
inferredcites →https://doi.org/10.1090/s0002-9904-1932-05460-xopenalex-snapshot
A logical expansion in mathematics
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/1968214openalex-snapshot
The Coloring of Graphs
inferredcites →https://doi.org/10.2307/2005719openalex-snapshot
A Handbook of Integer Sequences
inferredcites →https://doi.org/10.2307/3611504openalex-snapshot
Calculus of Finite Differences
inferredcites →https://doi.org/10.4153/cjm-1969-149-3openalex-snapshot
Reconstruction of Cacti

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.ch14openalex-snapshot
Chromatic Polynomials
inferred← citeshttps://doi.org/10.1002/jgt.3190080305openalex-snapshot
Cutpoints and the chromatic polynomial
inferred← citeshttps://doi.org/10.1002/jgt.3190110207openalex-snapshot
Classification of chromatically unique graphs having quadratic σ‐polynomials
inferred← citeshttps://doi.org/10.1002/jgt.3190110307openalex-snapshot
On 3‐colorings of bipartite p‐threshold graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190140110openalex-snapshot
The chromaticity of complete bipartite graphs with at most one edge deleted
inferred← citeshttps://doi.org/10.1002/jgt.3190160103openalex-snapshot
The number of shortest cycles and the chromatic uniqueness of a graph
inferred← citeshttps://doi.org/10.1002/jgt.3190170312openalex-snapshot
On chromatic uniqueness of two infinite families of graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190190210openalex-snapshot
On the join of graphs and chromatic uniqueness
inferred← citeshttps://doi.org/10.1006/jctb.1997.1811openalex-snapshot
Chromatic Coefficients of Linear Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1006/jctb.2000.1988openalex-snapshot
Contraction–Deletion Invariants for Graphs
inferred← citeshttps://doi.org/10.1007/978-3-0348-0859-0_12openalex-snapshot
Some Results on Chromaticity of Quasilinear Hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01270490openalex-snapshot
On trees of polygons
inferred← citeshttps://doi.org/10.1007/bf01787578openalex-snapshot
The search for chromatically unique graphs
inferred← citeshttps://doi.org/10.1007/s00373-008-0831-7openalex-snapshot
On the Chromaticity of Multi-Bridge Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-010-0984-zopenalex-snapshot
Pairs of Chromatically Equivalent Graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1232-5openalex-snapshot
On the Chromaticity of Quasi Linear Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02938-1openalex-snapshot
Counting Subgraphs of Coloring Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90012-2openalex-snapshot
Chromatic uniqueness of the generalized θ-graph
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90107-9openalex-snapshot
Chromatically unique graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90200-xopenalex-snapshot
On maximally saturated graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90072-4openalex-snapshot
The chromaticity of wheels
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(90)90041-fopenalex-snapshot
Two classes of chromatically unique graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90326-dopenalex-snapshot
The chromaticity of wheels with a missing spoke
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90320-2openalex-snapshot
On the chromatic uniqueness of certain bipartite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00482-7openalex-snapshot
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90346-uopenalex-snapshot
Chromaticity of a family of K4-homeomorphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0091-hopenalex-snapshot
The chromaticity of s-bridge graphs and related graphs
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/0012-365x(94)90123-6openalex-snapshot
On chromatic uniqueness of uniform subdivisions of graphs
inferred← citeshttps://doi.org/10.1016/j.akcej.2018.01.006openalex-snapshot
Zeroth-order general Randić index of cactus graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.10.010openalex-snapshot
On chromatic and flow polynomial unique graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.09.003openalex-snapshot
Series–parallel chromatic hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2003.05.003openalex-snapshot
Chromatic classes of 2-connected (n,n+4)-graphs with at least four triangles
inferred← citeshttps://doi.org/10.1016/j.disc.2003.06.010openalex-snapshot
On the minimum real roots of the σ-polynomials and chromatic uniqueness of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2003.06.014openalex-snapshot
The chromatic uniqueness of certain complete t-partite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.02.015openalex-snapshot
Sunflower hypergraphs are chromatically unique
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.079openalex-snapshot
On chromaticity of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.07.026openalex-snapshot
On the chromaticity of sunflower hypergraphs SH ( n , p , h )
inferred← citeshttps://doi.org/10.1016/j.disc.2008.08.016openalex-snapshot
Chromatic classes of 2-connected (n,n+4) -graphs with three triangles and one induced 4-cycle
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.008openalex-snapshot
On the chromaticity of complete multipartite graphs with certain edges added
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112605openalex-snapshot
Independence equivalence classes of cycles
inferred← citeshttps://doi.org/10.1016/j.jaubas.2017.03.003openalex-snapshot
A new method for proving dominating uniqueness of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00078-7openalex-snapshot
A new method for proving chromatic uniqueness of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00266-xopenalex-snapshot
Some problems on chromatic polynomials
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(96)00271-3openalex-snapshot
Adjoint polynomials and chromatically unique graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00203-3openalex-snapshot
Some families of chromatically unique bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0095-8956(81)80010-xopenalex-snapshot
Chromatic polynomaials for regular graphs and modified wheels
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70808-2openalex-snapshot
Chromatic Polynomials of Generalized Trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00225-1openalex-snapshot
Graphs determined by polynomial invariants
inferred← citeshttps://doi.org/10.1017/s1446788700034121openalex-snapshot
On the chromatic uniqueness of certain trees of polygons
inferred← citeshttps://doi.org/10.1063/1.4932483openalex-snapshot
Chromaticity of 6-bridge graph θ(3,3,3,b,c,d)
inferred← citeshttps://doi.org/10.1063/1.4995832openalex-snapshot
Chromatic uniqueness of 6-bridge graph θ(3,3,b,c,c,c)
inferred← citeshttps://doi.org/10.1063/5.0330845openalex-snapshot
Chromaticity of a type of 6-bridge graphs
inferred← citeshttps://doi.org/10.1080/03081080902722816openalex-snapshot
On the spectral radius of cacti withk-pendant vertices
inferred← citeshttps://doi.org/10.1080/09720529.2021.1891697openalex-snapshot
Integral-root polynomials and chromatic uniqueness of graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/890/1/012116openalex-snapshot
The chromaticity of a family of 6-bridge graph
inferred← citeshttps://doi.org/10.1090/conm/824/16457openalex-snapshot
Structure of the chromatic polynomial
inferred← citeshttps://doi.org/10.1134/s0081543812090015openalex-snapshot
Chromatic uniqueness of elements of height ≤ 3 in lattices of complete multipartite graphs
inferred← citeshttps://doi.org/10.1145/3620665.3640392openalex-snapshot
SEER: Super-Optimization Explorer for High-Level Synthesis using E-graph Rewriting
inferred← citeshttps://doi.org/10.1145/3669940.3707262openalex-snapshot
SmoothE: Differentiable E-Graph Extraction
inferred← citeshttps://doi.org/10.11606/d.100.2020.tde-07022020-121851openalex-snapshot
Coincidências: Problema dos aniversários e polinômios cromáticos
inferred← citeshttps://doi.org/10.17268/sel.mat.2019.01.04openalex-snapshot
List-Chromatic Number and Chromatically Unique of the Graph Kr2+Ok
inferred← citeshttps://doi.org/10.17516/1997-1397-2020-13-3-297-305openalex-snapshot
Colorings of the Graph K ᵐ 2 + Kn
inferred← citeshttps://doi.org/10.20944/preprints201808.0299.v1openalex-snapshot
Chromatic Polynomial and Chromatic Uniqueness of Necklace Graph
inferred← citeshttps://doi.org/10.22405/2226-8383-2024-25-2-208-221openalex-snapshot
The chromaticity of complete split graphs
inferred← citeshttps://doi.org/10.2989/16073606.2013.779612openalex-snapshot
Orderingn-vertex cacti with matching numberqby their spectral radii
inferred← citeshttps://doi.org/10.31642/jokmc/2018/120208openalex-snapshot
Chromaticity of Sylow Graph for the Cyclic Groups
inferred← citeshttps://doi.org/10.37236/2370openalex-snapshot
Some Results on Chromaticity of Quasi-Linear Paths and Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1810.05317openalex-snapshot
Independence Equivalence Classes of Paths and Cycles
inferred← citeshttps://doi.org/10.5402/2011/430396openalex-snapshot
Chromatic Classes of 2-Connected (n,n+4) -Graphs with Exactly Three Triangles and at Least Two Induced 4-Cycles
inferred← citeshttps://doi.org/10.7151/dmgt.1003openalex-snapshot
On chromaticity of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1064openalex-snapshot
Equivalent classes for K_3-gluings of wheels
inferred← citeshttps://doi.org/10.7151/dmgt.1128openalex-snapshot
Chromatic polynomials of hypergraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1699openalex-snapshot
Hypergraphs with pendant paths are not chromatically unique
inferred← citeshttps://doi.org/10.7155/jgaa.00490openalex-snapshot
Short certificates for chromatic equivalence
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.