On the public citation graph
The search for chromatically unique graphs
0 signed · 121 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.1002/jgt.3190010307openalex-snapshot
Chromatic polynomials and whitney's broken circuits
inferredcites →https://doi.org/10.1002/jgt.3190080303openalex-snapshot
Chromatic uniqueness and equivalence of K4 homeomorphs
inferredcites →https://doi.org/10.1002/jgt.3190080305openalex-snapshot
Cutpoints and the chromatic polynomial
inferredcites →https://doi.org/10.1002/jgt.3190100413openalex-snapshot
A note on chromatic uniqueness of graphs
inferredcites →https://doi.org/10.1002/jgt.3190110207openalex-snapshot
Classification of chromatically unique graphs having quadratic σ‐polynomials
inferredcites →https://doi.org/10.1002/jgt.3190110307openalex-snapshot
On 3‐colorings of bipartite p‐threshold graphs
inferredcites →https://doi.org/10.1002/jgt.3190140110openalex-snapshot
The chromaticity of complete bipartite graphs with at most one edge deleted
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
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(78)90012-2openalex-snapshot
Chromatic uniqueness of the generalized θ-graph
inferredcites →https://doi.org/10.1016/0012-365x(79)90107-9openalex-snapshot
Chromatically unique graphs
inferredcites →https://doi.org/10.1016/0012-365x(80)90154-5openalex-snapshot
On chromatic coefficients
inferredcites →https://doi.org/10.1016/0012-365x(82)90200-xopenalex-snapshot
On maximally saturated graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90072-4openalex-snapshot
The chromaticity of wheels
inferredcites →https://doi.org/10.1016/0012-365x(86)90146-9openalex-snapshot
On the chromatic uniquenes of bipartite graphs
inferredcites →https://doi.org/10.1016/0012-365x(88)90061-1openalex-snapshot
A note on the chromatic uniqueness of W10
inferredcites →https://doi.org/10.1016/0012-365x(90)90041-fopenalex-snapshot
Two classes of chromatically unique graphs
inferredcites →https://doi.org/10.1016/0012-365x(90)90326-dopenalex-snapshot
The chromaticity of wheels with a missing spoke
inferredcites →https://doi.org/10.1016/0012-365x(91)90471-dopenalex-snapshot
The chromatic uniqueness of certain broken wheels
inferredcites →https://doi.org/10.1016/s0021-9800(68)80087-0openalex-snapshot
An introduction to chromatic polynomials
inferredcites →https://doi.org/10.1016/s0095-8956(81)80010-xopenalex-snapshot
Chromatic polynomaials for regular graphs and modified wheels
inferredcites →https://doi.org/10.1090/s0002-9904-1932-05460-xopenalex-snapshot
A logical expansion in mathematics
inferredcites →https://doi.org/10.2307/1967597openalex-snapshot
A Determinant Formula for the Number of Ways of Coloring a Map
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.1003openalex-snapshot
Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190180109openalex-snapshot
On the sum of all distances in chromatic blocks
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/bf01793016openalex-snapshot
Another family of chromatically unique graphs
inferred← citeshttps://doi.org/10.1007/bf01858456openalex-snapshot
On the chromatic uniqueness of the graphW(n, n − 2, k)
inferred← citeshttps://doi.org/10.1007/s00373-003-0534-zopenalex-snapshot
On Graphs Determined by Their Tutte Polynomials
inferred← citeshttps://doi.org/10.1007/s00373-004-0560-5openalex-snapshot
The Chromaticity of Certain Complete Multipartite Graphs
inferred← citeshttps://doi.org/10.1007/s10114-011-8507-2openalex-snapshot
Chromatic uniqueness of certain complete tripartite graphs
inferred← citeshttps://doi.org/10.1007/s10255-010-0034-xopenalex-snapshot
Chromatically equivalent pairs of K 4-homeomorphic graphs
inferred← citeshttps://doi.org/10.1007/s10255-013-0206-6openalex-snapshot
Chromaticity of complete 6-partite graphs with certain star or matching deleted II
inferred← citeshttps://doi.org/10.1007/s11766-004-0029-6openalex-snapshot
Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with 5n vertices
inferred← citeshttps://doi.org/10.1007/s12190-009-0374-yopenalex-snapshot
On chromatic uniqueness of certain 5-partite 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(94)00056-oopenalex-snapshot
On the chromatic uniqueness of the graph W(n, n − 2) + Kk
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00248-hopenalex-snapshot
The chromaticity of wheels with a missing spoke II
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/0012-365x(95)00331-popenalex-snapshot
On graphs in which any pair of colour classes but one induces a tree
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.disc.2003.05.007openalex-snapshot
Divisibility of certain coefficients of the chromatic polynomials
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.2004.06.017openalex-snapshot
Some new results on chromatic uniqueness of K4 -homeomorphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.014openalex-snapshot
A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.040openalex-snapshot
On matroids determined by their Tutte polynomials
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.2007.07.030openalex-snapshot
A complete solution to the chromatic equivalence class of graph Bn-7,1,3¯
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.035openalex-snapshot
Chromatic uniqueness of a family of K4 -homeomorphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.059openalex-snapshot
Chromatic equivalence classes of complete tripartite graphs
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.ejc.2009.03.016openalex-snapshot
Homomorphisms and polynomial invariants of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.03.012openalex-snapshot
Distinguishing graphs by their left and right homomorphism profiles
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.038openalex-snapshot
Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness”
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2021.01.012openalex-snapshot
Splittings of toric ideals
inferred← citeshttps://doi.org/10.1016/j.jaubas.2013.05.003openalex-snapshot
Chromaticity of a family of 5-partite graphs
inferred← citeshttps://doi.org/10.1016/j.rineng.2026.112182openalex-snapshot
A study on chromatic polynomials of bunch graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00094-7openalex-snapshot
Chromatically unique bipartite graphs with low 3-independent partition numbers
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00217-5openalex-snapshot
A note on the chromaticity of some 2-connected (n,n+3)-graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00818-xopenalex-snapshot
Locally grid graphs: classification and Tutte uniqueness
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00874-9openalex-snapshot
Chromatic equivalence classes of certain generalized polygon trees, III
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00039-8openalex-snapshot
Chromatic uniqueness in a family of 2-connected 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)00268-3openalex-snapshot
Chromaticity of a family of K4 homeomorphs
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)00270-1openalex-snapshot
Chromatic uniqueness of the complements of certain forests
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(96)00288-9openalex-snapshot
All wheels with two missing consecutive spokes are chromatically unique
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00289-0openalex-snapshot
On the structure and chromaticity of graphs in which any two colour classes induce a tree
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/s0012-365x(99)00014-xopenalex-snapshot
Structures and chromaticity of some extremal 3-colourable graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00225-1openalex-snapshot
Graphs determined by polynomial invariants
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/00207160.2013.814771openalex-snapshot
New result on chromaticity ofK4-homeomorphic 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.1109/cis.2010.143openalex-snapshot
A Method to Find Chromatically Unique Multipartite Graphs
inferred← citeshttps://doi.org/10.1109/iacsit-sc.2009.125openalex-snapshot
A Family of Chromatically Unique k-Bridge Graphs
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.1134/s008154808050027openalex-snapshot
Chromatic uniqueness of atoms in lattices of complete multipartite graphs
inferred← citeshttps://doi.org/10.12732/ijpam.v85i1.4openalex-snapshot
CHROMATIC EQUIVALENCE OF A FAMILY OF K4-HOMEOMORPHS WITH GIRTH 9
inferred← citeshttps://doi.org/10.12988/ams.2013.13016openalex-snapshot
A remark on chromatically unique 5-partite graphs
inferred← citeshttps://doi.org/10.15826/umj.2021.1.004openalex-snapshot
ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
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.22199/issn.0717-6279-2933openalex-snapshot
A new family of chromatically unique 6-bridge 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.2298/aadm100512023lopenalex-snapshot
Chromaticity of complete 4-partite graphs with certain star or matching deleted
inferred← citeshttps://doi.org/10.24996/ijs.2017.58.4a.17openalex-snapshot
Solving of Chromatic Number, Chromatic Polynomial and Chromaticity for a Kind of 6-Bridge Graph Using Maplesoft
inferred← citeshttps://doi.org/10.31642/jokmc/2018/120208openalex-snapshot
Chromaticity of Sylow Graph for the Cyclic Groups
inferred← citeshttps://doi.org/10.33048/semi.2019.16.120openalex-snapshot
On garlands in $\chi$-uniquely colorable graphs
inferred← citeshttps://doi.org/10.37236/1765openalex-snapshot
Chromatically Unique Multibridge Graphs
inferred← citeshttps://doi.org/10.37236/2072openalex-snapshot
The Covered Components Polynomial: A New Representation of the Edge Elimination Polynomial
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.1010.4146openalex-snapshot
On the chromatic uniqueness of $K_4$-homeomorphs with girth 7
inferred← citeshttps://doi.org/10.48550/arxiv.1802.01082openalex-snapshot
About chromatic uniqueness of some complete tripartite graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2016.4.1.6openalex-snapshot
Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)
inferred← citeshttps://doi.org/10.7151/dmgt.1064openalex-snapshot
Equivalent classes for K_3-gluings of wheels
inferred← citeshttps://doi.org/10.7151/dmgt.1067openalex-snapshot
The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six
inferred← citeshttps://doi.org/10.7151/dmgt.1401openalex-snapshot
The chromatic equivalence class of graph B n-6,12
inferred← citeshttps://doi.org/10.7151/dmgt.1699openalex-snapshot
Hypergraphs with pendant paths are not chromatically unique
inferred← citeshttps://doi.org/10.7494/opmath.2010.30.2.123openalex-snapshot
On chromatic equivalence of a pair of K4-homeomorphs
inferred← citeshttps://doi.org/10.7508/ijmsi.2014.02.005openalex-snapshot
Chromaticity of Turan Graphs with At Most Three Edges Deleted
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.